1. Show the contents of the id[] array and the number of times the array is accessed for each input pair when you use quick-union for the sequence

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

2. draw the forest of trees represented by the id[] array after input pair is processed.
3. Correct these intuitive implementations of find() and union() methods for quick-union

	private int find(int p) { while(p!=id[p]) id[p]=p; return p; }
		public void union(int p, int q) { int pRoot=find(p); int qroot=find(q); if (proot==qroot) return; id[proot]=id[qroot] count--;}