Modify the proof of correctness of Kruskal$$s algorithm $($based on

induction$)$ to show that the algorithm you designed above is in fact correct and returns the

maximum spanning treeQuestion $4\mathrm{.}1(4$ points$)$ Modify Kruskal's algorithm to return the Maximum Spanning

Tree $($that is$,$ a spanning tree of maximum possible weight$)$ and write the pseudo$-$code.

Question $4\mathrm{.}2(2$ points$)$ Modify the proof of correctness of Kruskal's algorithm $($based on

induction$)$ to show that the algorithm you designed above is in fact correct and returns the

maximum spanning tree