1. For the graph below, find a minimum spanning tree and write out the arcs being added at each step using A) Prims Algorithm and B) Kruskal's Algorithm. 10 10 10 Show that 2 of your troe ares are optimal using the cut optimality condition and theat not selecting 2 of your non-tree ares was optimal using the path optimality condition. Write the optimization model for the MST using the complete problem data. You do 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 grcater