Show how Kruskal algorithm can be modified to find a maximum spanning tree (i.e. a spanning tree with maximum total cost) from the following graph. 12 E Explain how to modify Kruskal to find maximum spanning tree instead of minimum spanning tree. Show how your modified algorithm finds a solution for the given graph. Draw the maximum spanning tree and give maximum total cost of this tree. 16 22 5 B 10 20 25 11 18 8