) Write algorithms for UNION( ) and MAKE-SET( ) operations of Disjoint-Set Forest data
structure assuming union-by-rank and the path-compression heuristics