Old MathJax webview

please read carefully and kindly answer the question properly step by step which is asked in the question.

7 .78 763 1.64 169 .75 .83 172 1.87.63 .71 .63 6 3 66 81 .78 .72 70 .61 .68 5 Figure: 1 0 11 14 10 7 5 2 Figure: 2 Two weighted graphs are given in figure 1 & figure 2. 1. Analyze the graph in figure 1 and give detailed explanation about which MST algorithm between Prim & Kruskal, you will use on the graph, if your objective is to reduce the execution time of the algorithm. Mention the complexity of the algorithm 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. Marks 5 4 3 Level Descriptions Excellent Both parts are answered correctly with right explanations. Very Good Both parts are answered correctly but one of the explanations is not sufficient. Good Both parts are answered correctly but both explanations are not sufficient. Average Only one of the answers are given correctly with explanation, or both answers are correct, but th explanations are mostly wrong. Poor Only correct answers are mentioned. 2 1