Compute a minimum spanning tree of the above graph using Prim's algorithm. Fill in the following table so that

each row will contain the key and parent values at a step of the algorithm. Start with A$1.$ Draw the spanning tree

in the next page.

A$1$ A$2$ A$3$ A$4$ B$1$ B$2$ B$3$ B$4$ C$1$ C$2$ C$3$ C$4$

In the same graph above, use Dijkstra$$s algorithm to compute a shortest path tree rooted at A$1.$ Again use the following table and draw your shortest path tree