Q$1.(20$ pts$)$ Given the following weighted graph, show the execution of the Kruskal$$s

algorithm which identifies its Minimal Spanning Tree $($MST$).$ Draw Two graphs each time

an edge is added into the MST:

$$ The Partial Forest, and

$$ The Up$-$Tree implementation for disjoint set data structure

Note:

$1.$ Adopt the Union$-$by$-$Height strategy to union two disjoint sets.

$2.$ If two trees are of the same height in the disjoint sets, set the smaller$-$letter node as the

new root.

Step $1$ and $2$ are given as examples. Please complete the rest of steps.