No specific programming language.

11. Run the median finding algorithm on the array containing the numbers 11,1, 10, 2, 3,9, 8,4, 7,5 6. Assume that at each stage, the pivot is the rightmost key in the array. For example, in the first step, the pivot is 6. Repeat the question, but now the pivot is the leftmost key. 11. Run the median finding algorithm on the array containing the numbers 11,1, 10, 2, 3,9, 8,4, 7,5 6. Assume that at each stage, the pivot is the rightmost key in the array. For example, in the first step, the pivot is 6. Repeat the question, but now the pivot is the leftmost key