Question 4 (25 marks) (a). Apply Kruskal's algorithm, find the minimum spanning tree of the graph in Figure 3. Show the steps. [9 marks) B E 3 2 1 2 F H 3 2 D 5 Figure 3. Graph-1 (b). Figure 4 shows a weighted directed graph with each edge representing the direct path from one node to another and each weight representing the distance of the edge. Apply Dijkstra's algorithm, find the shortest path from node 'A' to every other node in Figure 4. Show the steps. [9 marks) 3 E 3 3 5 5 F F H 2. 5 Figure 4. Graph-2