Answer questions for the following graph. For the same edge length, you could order the edges using the alphabet order. (For example, for length 2, the order is AB,AE, CD, CE)
a) Construct the minimakl spanning tree using Prim’s algorithm using A as the root. No need to show detail steps, but need to show the selecting order.
b) Construct the shortest path using Dijkstra’s algorithm, using A