Use Prim$$s algorithm on the above graph to determine the Minimum$-$Cost Spanning Tree of

directed edges with node E as the $$root$$ of the MCST $($e$.$g$.$ node E is the source of a cable

broadcast, and the MCST shows how the signal will be transmitted to every station in the

network$).$ Show the graph of your MCST below using an adjacency$-$list representation, and draw

the directed MCST on the graph above. Ties may be broken randomly.Use Prim's algorithm on the above graph to determine the Minimum$-$Cost Spanning Tree of

directed edges with node E as the "root" of the MCST $($e$.$g$.$ node E is the source of a cable

broadcast, and the MCST shows how the signal will be transmitted to every station in the

network$).$ Show the graph of your MCST below using an adjacency$-$list representation, and draw

the directed MCST on the graph above. Ties may be broken randomly.