Answer the following questions related to deterministic quicksort with partition choosing the last element as pivot. use figures to illustrate the operation of partition on array [13, 19, 9, 5, 12, 8, 7, 4, 11, 2, 6, 21]. what is the running time of quicksort when all elements of array have the same value? explain your answer. what is the running time of quicksort when elements of array are in decreasing order? explain your answer.