Please solve part C and D based on the information that given from part A and B with out using computer.

3. For the graph below: 10 9 4 6 10 10 13 (a) Find a minimum spanning tree and write out the arcs being added at each step using (b) Find a minimum spanning tree and write out the arcs being added at each step using (c) Show that 2 of your tree arcs are optimal using the cut optimality condition and that (d) Write the optimization model for the MST using the complete problem data. You do Prims Algorithm Kruskal's Algorithm. not selecting 2 of your non-tree arcs was optimal using the path optimality condition. not need to write all of the no-cycle constraints- you should write at least 3 of them that have a subset size of 3 or greater