Complete with "The Dutch National Flag"

(Adapt the Dutch National Flag algorithm to do the quicksort partitioning. Consider the red region to be those values less than the pivot, the white region to be those values equal to the pivot, and the blue region to be those values equal to the pivot. You should initially sort the first, middle, and last items and use the middle value as the pivot value.)

Q1 - When does quicksort work best, and when does it work worst

Q2 - What is the purpose of the pivot value in quicksort? How did we first select it in the text, and what is wrong with that approach for choosing a pivot value?

Q3 - For the following array 30 40 20 15 60 80 75 4 20

Show the new array after each pass of insertion sort and selection sort. How many comparisons and exchanges are performed by each?

Please provide a full solution that I can run in Netbeans. Thanks