(Solved): Problem 1. [10 marks] Perform the following UNION operation on the disjoint-set forest shown in fig ...

Problem 1. [10 marks] Perform the following UNION operation on the disjoint-set forest shown in figure 1. UNION( $f,k)$ Apply both the union by rank and path compression heuristics to improve the running time while doing the UNION operation. Given the rank of root node ' $a$ ' is 3 and the rank of root node ' $h$ ' is 2 . Figure 1