Exercise 5: Consider the following graph G: 20 65 20 15 50 20 15 20 30 1. Using Prim's algorithm, find a minimum spanning tree of the graph G. Write all the steps (as we did in the class). 2. Using Kruskal's algorithm, give a minimum spanning tree and write all the steps (add 3 and ignore) as we did in the class)