a) Please write the C program to find the shortest path from node 1 to all other nodes using Dijkstra's algorithm. b) Please find the shortest path and the path itself between the each pair of nodes...

Extracted text: a) Please write the C program to find the shortest path from node 1 to all other nodes using Dijkstra's algorithm. b) Please find the shortest path and the path itself between the each pair of nodes using Floyd's algorithm. 5. Please write C code of the matrix chain multiplication (Al.A2.A3) by using dynamic programming as given below. Then calculate the algorithmic complexity. Al: 3x4 PO=3 P1=4 P2=2 P3=5 A2: 4x2 A3: 2x5 2


Extracted text: Analysis of Algorithms PART A. Recursion and complexity calculations 1. Please consider the following function and determine the Big-O notation using recurrence relation. int fun (int n) if (n 0 || n 1) == == return n; if (n%3 ! = 0) return 0; return fun (n/3); 2. Write a function to find the largest element of an array using ; a. Tail recursion b.Non-tail recursion PART B. various algorithms types, complexity and programming 3. Please use a dynamic programming technique to find the Longest Common Subsequence of the "BEAR" and "PEAR". Obtain the table by showing your calculations clearly, and sequences; write the C function of this problem. 4. Please perform the following sections to find the shortest path of the nodes given in following graph. 5 1 4 3. 1 1 2.