Show the final result of executing the following instructions with UF_WeightedQuickUnion: union(0, 4), union(9, 6), union(3, 5), union(9, 2), union(7, 1), union(4, 8), union(5, 4), union(2, 0). Assuming set consists of numbers from 0 to 9, and initially there are 10 components.

a) Show the final contents of id[] array

b) Draw the final forest of trees.

5 public class UF_WeightedQuickUnion extends UF 21 @0verride 6 private int 7 sz; II size of component for roots 22 // worst-case running time 0(1gn) 23 public void union(int p, int q) 24 25 26 27 28 29 30 31 32 8 public UF_WeightedQuickUnion(int n) { super(n); sz new int [n] for (int 1-0; i