PART B. various algorithms types, complexity and programming 3. Please use a dynamic programming technique to find the Longest Common Subsequence of the sequences; BEAR and PEAR. Obtain the table by showing your calculations clearly, and write the C function of this problem. (20 pts.) 4. Please perform the following sections to find the shortest path of the nodes given in following graph. 5 1 4 2 3 2 4 N 3 a) Please write the C program to find the shortest path from node 1 to all other nodes using Dijkstra's algorithm. (10pts) b) Please find the shortest path and the path itself between the each pair of nodes using Floyd's algorithm. (20pts.)