Weighted Graph Data structure

Exercise 3: MST with Weighted Graph Fig 3 a. Apply MST on the graph provided in Fig3. Show all the steps and final MST graph b. Apply Dijkstra's algorithm using A as the starting (source) node. Indicate the cost and predecessor for each node in the graph Remember to update the appropriate table entries Note: do not simply fill in the entire table with the final costs and predecessors instead of showing the table with all the steps