3. Disjoint Sets // Union-Find You are given a set of unconnected nodes o through 7. You now perform the following operations in the given order on the nodes Union (o,1), Union (2,3), Union (o,2), Union 4,o), Union(5,6), Union(75), Union (5,4), Find (5) where Union(x,y) makes the sentinel of x point to the sentinel of y and does not perform a weighting optimization (neither by size nor by height). Give the array representation of this disjoint set data structure if the above operations use.. (a) (5 points- Correctness) .. no path compressions (b) (5 points-Correctness).path compressions