Execute Kruskal's algorithm on the weighted tree shown below. Assume that edges of equal weight will be in the priority queue in alphabetical order and each edge name is ordered alphabetically. Clearly show what happens each time an edge is removed from the priority queue and how the dynamic equivalence relation changes on each step and show the final minimum spanning tree that is generated