PLEASE SOLVE ALL PLEASE

Question 18.1 (G2) Find a minimum-weight spanning tree for the graph in Figure 4 using Kruskal's algorithm. For credit I must see the work, not simply the final graph. Your final graph should have weight 15. Question 18.2 (G2) Find a minimum-weight spanning tree for the graph in Figure 4 using Prim's algorithm. For credit I must see the work, not simply the final graph. Your final graph should have weight 15 Question 18.3 (G2) Find a weight-labeling for the graph in Figure 5 so that it is possible to end up with different minimum-weight spanning trees from different applications of Kruskal's or Prim's algorithms. (Notice, your work must include the weighted graph, and the two different spanning trees with work to show how you got them.) Question 18.4 (G2) Find a mimimum-weight spanning tree of the graph given in Figure 6 using Kruskal's or Prim's algorithm. Notice: The missing weight on the right hand side of the image should be a 22, and the total weight of a correct answer should be 435. 3 3 3 9 3 3 1 Figure 5: Question 18.3 Figure 4: Questions 18.1 and 18.2 20 16 24 16 18 13 14 28 26 20 32 25 50 17 19 12 15 18 10 25 Figure 6: Question 18.4