algorithms analysis fast please

Array a= {6,1,10, 9, 7, 4, 8, 2, 15 }; After the second iteration of the quick sort the array becomes O a.a= {2 1 4 6 7 9 8 10 15} O b. a={4 1 2 6 7 9 8 10 15) O c. a={6 1 4 2 7 9 8 10 15} O d. a={1 2 4 6 7 9 8 10 15} After two iterations the array elements are ordered as shown here: 24 5 7 16 7 9. Then we use selection sort us Select one: True O False Array a= {6,1,10, 9, 7, 4, 8, 2, 15 }; After the second iteration of the quick sort the array becomes O a.a= {2 1 4 6 7 9 8 10 15} O b. a={4 1 2 6 7 9 8 10 15) O c. a={6 1 4 2 7 9 8 10 15} O d. a={1 2 4 6 7 9 8 10 15} After two iterations the array elements are ordered as shown here: 24 5 7 16 7 9. Then we use selection sort us Select one: True O False