Q4(a) Illustrate the procedure of Depth First Search with the below given graph from vertex A and write the order of vertices's visited [8] (b) Apply Dijkstra's algorithm to find the shortest path from A to F in the following graph. 10 [10] 5 (c) Consider the weighted graph G = (V. E, w), where edges/eights are given by E = {(A, B, 4). (A E, 5). (B, C, 2), (C, D, 1), (E,D, 7), (A, C, 6), (A, D, 6). (B.E, 3), (C,E,5)} @ Draw the weighted graph G. [2] (1) Use Prim's algonthm to find a minimum spanning tree for the above given graph