Considering the following graph, B 5. 3 2 1 2 3 6 F 7 E a. Find the shortest path from A to all other vertices for the graph. b. Find the shortest unweighted path from B to all other vertices for the graph. QUESTION 7 (10%) Find the maximum flow in the network below. 6 4 2 2 B 3 2 2 4 3 3 3 E F 2 2. 3 4 6 6 H I QUESTION 8 (8%) Considering the following graph, 3 10 B 4 4 2 3 5 11 E 2 F 6 2 1 3 1 4 7 H a. Find a minimum spanning tree for the graph using both Prim's and Kruskal's algorithms. b. Is this minimum spanning tree unique? Why?