Show work

Q-8a: Apply quicksort to A = { 6, 3, 8, 7, 5, 2, 4 }. State the order of the data after the 1st and 2nd median-of-three based pivot selection has taken place as well as after the associated partitions. Use the algorithm from class where the pivot is moved to the right during partitioning (see HW3). Instead of underlining the median-of-three numbers, place a . in front of them and place a in front of the pivot when it reaches its final location. State your answer as pivot selection 1 { .b, b, a, .M, C, .R } - partitioning 1 { .b, b, a, 5, +M, .R } etc. Q-8a: Apply quicksort to A = { 6, 3, 8, 7, 5, 2, 4 }. State the order of the data after the 1st and 2nd median-of-three based pivot selection has taken place as well as after the associated partitions. Use the algorithm from class where the pivot is moved to the right during partitioning (see HW3). Instead of underlining the median-of-three numbers, place a . in front of them and place a in front of the pivot when it reaches its final location. State your answer as pivot selection 1 { .b, b, a, .M, C, .R } - partitioning 1 { .b, b, a, 5, +M, .R } etc