1. Write down all steps in all iterations to find a minimal spanning tree in the given graph starting from the vertex u using Prim's algorithm. 2. Draw the result (a minimal spanning tree) of application of Prim's algorithm. 3. Write down the sequence of edges given as pairs of their endpoints to find a minimal spanning tree in the given graph using Kruskal's algorithm. 4. Draw the result (a minimal spanning tree) of application of Kruskal's algorithm. 5. Write down the sum of weights after each iteration of Prim's and Kruskal's algorithms showing how the sum of weights is growing and reach the final value. The given graph: 3 o 2 1 1 2 5 u Z 2 2. 3 s 2