Q1. (40 pts) Find the shortest path using Dijkstra's algorithm from node A to all other vertices for the following graph. For this question, the solution must be provided step by step to get full credit as shown in your textbook in Figures 9.20 through 9.27 in pages 394-396. 5 B 17 3 1 1 6 F 8 . 10 3 D 5 4 mi Q2. (30 pts) Find the minimum spanning tree using Prim's algorithm for the following graph starting from vertex A. For this question, the solution must be provided step by step. B . 6 7 18 A . 5 1 lo H 3 12 14 E G 8 8 5 F Q3. (30 pts) Find the minimum spanning tree using Kruskal's algorithm for the following graph. For this question, the solution must be provided step by step. B 6 6 2 8 D 7 A . IL 5 1 10 H 12 E G 8 8 ore F