G: el 8 8 3 6 10 The 3 algorithms: Kruskal's, Prim's and Dijkstra's, are the handouts in the Week 8- 9 folder. Do not use any other algorithms. Use standard alpha-numeric conventions as appropriate (a) Apply Kruskal's algorithm to the graph G. Begin by recording the input in a table: A list of the edges of the graph sorted first by edge weight, and then alpha numerically for any edges of the same weight. As you execute the algorithm, clearly indicate which of the edges are selected. Draw the resultant Minimum Weighted Spanning Tree (MWST) and state the its overall weight. (b) Apply Prim's algorithm to G beginning at vertex a. Set out your solution as shown in week 8 tutorial solutio (c) Find the shortest path from vertex b to all other vertices in G using Dijkstra's Distance Algorithm. Show a table of the labels at each stage and draw the resultant spanning tree. (Set out as per week 8 tutorial solutions.)