I need a correct answer.. If you can, so please solve this problem correctly which is asked. Otherwise don't answer.

8 8 7 N 3 2 11 14 6 8 10 7 6 5 2 N Figure: 2 Two weighted graphs are given in figure 1 & figure 2. 1. Anal show. in figurant det" wh: "T " 1 u will ..ve is to the Page 2 of 3 2. Analyze the graph in figure 2 and give detailed explanation about which MST algorithm between Prim & Kruskal, you will use on the graph, if your objective is to find the forest of all MSTs in the graph