Considering the following graph G.

a) [1%] Write out the cost of the maximum cost spanning tree for graph G.

b) [2%] Write out the last edge selected into the maximum cost spanning tree for graph G when using Kruskal's method.

c) [2%] Write out the 5th edge selected into the maximum cost spanning tree for graph G when using Prim's method starting with vertex a.