Using QUICK UNION (not weighted, no path compression): What is the contents of the id[] array after running quick-union on the following sequence, where 9-0 represents a call to uf.union(9,0).

9-0 3-4 5-8 7-2 2-1 5-7 0-3 4-2

Show your work in Java!

Possible answers:

public class UF UF(int n) initialize n sites with integer names (o to n-1) void union(int p, int q) add connection between p and a int find(int p) component identifier for p (0 to n-1) boolean connected(int p, int q) return true if pand q are in the same component int count number of components i: 0 1 2 3 4 5 6 7 8 9 id[i]: 9 7 7 9 3 9 6 5 5 9 i: 0 1 2 3 4 5 6 7 8 9 id[i]: 9 7 7 9 3 7 6 7 5 7 i: 0 1 2 3 4 5 6 7 8 9 id[i]: 4 1 1 4 1 8 6 2 10 i: 0 1 2 3 4 5 6 7 8 9 id[i]: 9 9 9 9 996999 i: 0 1 2 3 4 5 6 7 8 9 id[i]: 1 1 1 1 1 1 6 1 1 1 public class UF UF(int n) initialize n sites with integer names (o to n-1) void union(int p, int q) add connection between p and a int find(int p) component identifier for p (0 to n-1) boolean connected(int p, int q) return true if pand q are in the same component int count number of components i: 0 1 2 3 4 5 6 7 8 9 id[i]: 9 7 7 9 3 9 6 5 5 9 i: 0 1 2 3 4 5 6 7 8 9 id[i]: 9 7 7 9 3 7 6 7 5 7 i: 0 1 2 3 4 5 6 7 8 9 id[i]: 4 1 1 4 1 8 6 2 10 i: 0 1 2 3 4 5 6 7 8 9 id[i]: 9 9 9 9 996999 i: 0 1 2 3 4 5 6 7 8 9 id[i]: 1 1 1 1 1 1 6 1 1 1