Q$2)$ Given the following connected components, implement the operations in sequence and show the graph after each operation. Union is performed by rank and find is executed with path compression. When the union of two components of the same size is performed then one with smallest root $($in terms of index$)$ becomes the overall root.

$($i$)$ Union $(8,9)$

$($ii$)$ Union $(7,4)$

$($iii$)$ Union $(2,9)$

$($iv$)$ Find$(10)$