provide explaination

Consider the QUICKSORT(A, low, high) algorithm that chooses the pivot value using middle- of-three technique. The recursive calls QUICKSTOR(A, low, mid 1) and QUICKSORT(A, mid + 1, high). Let low = 1 and high = 9. Using the left-guard and right-guard partition algorithm, as discussed in lecture and middle-of-three technique of selecting a pivot value, what is the pivot value and the position in the array the pivot value will be placed. Assume the initial state of the array A[low, high] looks as follows: 0 1 2 3 937 11 4 5 6 7 8 5 | 1 | 8 12 6 A. Pivot: 9, position placed in array: 6 B. Pivot: 6, position placed in array: 3 C. Pivot: 5, position placed in array: 2 D. Pivot: 7, position placed in array: 4 E. Pivot: 8, position placed in array: 5