Implement Quicksort to sort $13,19,9,5,12,8,7,4,11,2,6,21$ on your Computer.

when the pivot is chosen as

$($A$)$ the first element

$($B$)$ the larger of the first two distinct elements

$($C$)$the median$-$of$-3$: Choose the pivot as the median $($middle element$)$ of a set of $3$ elements randomly selected from the input list

You should

provide Screen Shots for showing compilation, program running of your computer, and test your program.

Write a short report in $1$ or $2$ page to discuss your implementation & results of your program.