Please provide Answer for both part a and b Also provide complete explanation asap

4. (10 pts) (a) Suppose we want to find the minimum spanning tree of the graph shown on Figure 1. Run Prim's algo rithm; whenever there is a choice of nodes, always use alphabetic ordering (e.g., start from node A). Draw a table showing the intermediate values at every stage. 7 Figure 1: Input graph for Question 4 COMP 3804 ASSIGNMENT 1 (b) Run Kruskal's algorithm on the same graph. Show how the disjoint-sets data structure looks at every intermediate stage (i.e., the structure of the directed trees), assuming path compression is used