algorithm choice the correct answer

Question 9: Consider the following dynamic connectivity problem and we want to solve it using Weighted Quick-Union algorithm. After executing Union (7,4) A. 7 will become the child of 4 B. 7 will become the child of 3 C. 7 will become the child of 8 D. None of the answers Question 10: Consider we want to apply SelectionSort on the following array: i 2 4 0 12 1 3 3 9 5 5 6 44 7 33 8 1 array 6 8 The first exchange that will take place is between: A. 3 and 33 B. 12 and 33 C. 1 and 44 D. 12 and 1 Question 11: Consider we have the following snapshot' of an array while running Selection Sort 0 4 8 1 5 2 18 3 22 5 31 6 32 7 9 3 19 44 The outer loop counter (i) is likely to be at index A. 3 B. 4 C. 6 D. 2 Question 11: Consider we have the following snapshot' of an array while running SelectionSort 0 3 1 5 2 18 3 22 4 19 5 31 6 32 7 9 8 44 The outer loop counter (i) is likely to be at index A. 3 B. 4 C. 6 D. 2 Question 12: Consider we have the following snapshot' of an array while running InsertionSort 0 3 1 5 2 18 3 22 4 19 5 31 6 32 7 9 8 44 The outer loop counter (i) is likely to be at index A. 5 B. 6 C. 7 D. 3