Java

Implement the find method of the below WeightedQuickUnionUF class such that it teturns the component id of site P(root of the tree that contains p). Also, considering the below initial parent array for N = 10 sites, complete the corresponding size array and the updated aprent and size arrays after the call to union (1, 8). public class WeightedQuickUnionUF {private int[] parent;//parent[i] = parent of i private int[] size;//size[i] = number of sites in subtree rooted at i public WeightedQuickUnionUF(int N) {parent = new int[N]; size = new int[N]; for (int i = 0; i