1. Write down all steps in all iterations to find a minimal spanning tree in the given graph starting from the vertex b using Prims algorithm.

2. Draw the result (a minimal spanning tree) of application of Prims 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 Kruskals algorithm.

4. Draw the result (a minimal spanning tree) of application of Kruskals algorithm.

The given graph:

5. Write down the sum of weights after each iteration of Prims and Kruskals algorithms showing how the sum of weights is growing and reach the final value.

3. Write down the sequence of edges given as pairs of their endpoints to find a minim Kruskal's algorithm. 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 algorithn and reach the final value. The given graph: 1 a b 3 5 1 2 1 d 3 e 40 2 4 4 f g bo th 1 2 Important notes: - Students have to solve tasks by a hand and show all iterations and steps. - Students have to create a report as pdf or doc file which contains the photos of their order of the solution. - Only one file could be attached