Hello i need the solution Using algorithm

Question 1: 2 Consider an array of elements: array [7] = {1, 2, 3, 4, 5, 6, 7}, specify the number of comparisons that will take place using: A. Insertion sort B. Selection sort Question 2: A. 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 B. draw the forest of trees represented by the id[] array after input pair is processed. C. 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 root=find(q); if (proot=root) return; id[proot]=id[groot] count-->