(a) Where in a max-heap the smallest element might reside, assuming all elements are distinct? (b) Is an array that is in a sorted order a min-heap? (c) Is the sequence 23,17,14,6,13,10,1,5,7,12 a max-heap? (d) What is the running time of (deterministic) quicksort when all elements of the input sequence have the same value? (e) Why do we analyze the average-case performance of the randomized algorithm and not its worst-case performance