(Solved): Given the following graph a) Find the MST of the graph below using Prim's alg. Start with node (a) ...

Given the following graph a) Find the MST of the graph below using Prim's alg. Start with node (a) and show the priority queue Q with keys and ${\mathrm{V}}_{\mathrm{A}}$ every time you add an edge to the MST. b) Find the MST of the graph below using Kruskal's algorithm. Show the order of edges and illustrate what happens after processing each edge. You need to show all the intermediate steps