Help me with it. Its java language

Recall that the Union-Find Algorithms solve the connectivity problem. Also, recall that: 1. We are given a sequence of Unions of pairs (p.q) with the interpretation that the algorithm should "connect object p to object q'", and 2. These algorithms maintain an array id such that idlpl - idial if and only if the objects p and q are connected Assume that we have a set of 7 disjoint subsets each containing one element. Accordingly. the initializing phase concludes as follows: for (-0:N idbJ Using the weighted quick-union algorithm, show the contents of the idl ] array after each of the following 5 successive union operations: oopnsn Union (8, 4) Union (5, 1) Union (2, 6) Union (8, 3) Union (4, 2) 5 successive union operations means that: the first operation starts after initialization and each of the remaining 4 operations starts with the result of the previous operation 43 F7 Dil F8 F3 F4 FS F6 #9 Recall that the Union-Find Algorithms solve the connectivity problem. Also, recall that: 1. We are given a sequence of Unions of pairs (p.q) with the interpretation that the algorithm should "connect object p to object q'", and 2. These algorithms maintain an array id such that idlpl - idial if and only if the objects p and q are connected Assume that we have a set of 7 disjoint subsets each containing one element. Accordingly. the initializing phase concludes as follows: for (-0:N idbJ Using the weighted quick-union algorithm, show the contents of the idl ] array after each of the following 5 successive union operations: oopnsn Union (8, 4) Union (5, 1) Union (2, 6) Union (8, 3) Union (4, 2) 5 successive union operations means that: the first operation starts after initialization and each of the remaining 4 operations starts with the result of the previous operation 43 F7 Dil F8 F3 F4 FS F6 #9