Run Prim (starting from vertex b) and Kruskal algorithms on the graph below:

A. For Prims algorithm draw a table that shows the vertices in the queue at each iteration, similar to the example run in class. B. Prims algorithm: using the table from the first part, list the order in which edges are added to the tree. C. Kruskals algorithm: list the order in which edges are added to the tree.