3. Assume the weighted Quick-Union with Path Compression model and the below id] array: i 0 1 2 3 4 5 6 7 8 9 id] 0 0 0 3 3 7 7 7 9 9 (a) Draw the trees represented by the above table. [2 marks] (b) Execute union (1,8) and draw the resulting tree. [2 marks] (c) Execute union (4,5) and draw the resulting tree2 marks] 3. Assume the weighted Quick-Union with Path Compression model and the below id] array: i 0 1 2 3 4 5 6 7 8 9 id] 0 0 0 3 3 7 7 7 9 9 (a) Draw the trees represented by the above table. [2 marks] (b) Execute union (1,8) and draw the resulting tree. [2 marks] (c) Execute union (4,5) and draw the resulting tree2 marks]