2. (14 points) Consider the following weighted graph G: 구 12 2 12 나 2 12 Use Prim's algorithm t...
Discrete math! Please ensure the answers are correct and
thorough/justified! Thank you.
2. (14 points) Consider the following weighted graph G: 구 12 2 12 나 2 12 Use Prim's algorithm to find a minimal spanning tree T of this graph starting at the vertex s. You do not need to show every step of the algorithm, but to receive full credit you should: o list the edges of T in the order in which they're added; redraw G and indicate which edges belong to T; * compute the cost of T.
2. (14 points) Consider the following weighted graph G: 구 12 2 12 나 2 12 Use Prim's algorithm to find a minimal spanning tree T of this graph starting at the vertex s. You do not need to show every step of the algorithm, but to receive full credit you should: o list the edges of T in the order in which they're added; redraw G and indicate which edges belong to T; * compute the cost of T.