QUICKSORTIAP 2 9. PARTITIONA. QUICKSORTIA. p. 9-1 4 QUICKSORTA 4.0-2.0 PARTITIONIAD. 1 X Alri 2 - 3 forje por 4 Alsx 5 exchange All with All 7 exchange Ales) with 8 return i-2 Given the array 110.9.532.18.71, which element becomes the first pivot? Select one 0.10 3 What is the time complexity of partition if the order of elements to be partitioned is sorted in increasing order? Select one () Ob (1) con log) don) o e Ollong) What is the time complexity of partition if the order of elements to be partitioned is sorted in decreasing order? Select one 20) Ob 0(1) 0 (m long ) Oflog) 0.0(2)