Q:Question:Run Prim and Kruskal algorithms on the graph below Run Prim (starting from vertex a) and Kruskal algorithms on the graph below: - (5 pts) For Prim's algorithm draw a table that shows the vertices in the queue at each iteration, similar to the example run in class. - (2 pts) Prim's algorithm: using the table from the first part, list the order in which edges are added to the tree. - ( 3 pts) Kruskal's algorithm; list the order in which edges