Implement two different versions of quicksort in a high level programming language. The first version will use the first element of the array as the pivot. The second version will use the median of the first element, middle element, and last element of the array as the pivot.

Implement two different versions of quicksort in a high level programming language. The first version will use the first element of the array as the pivot. The second version will use the median of the first element, middle element, and last element of the array as the pivot. For each version, compare the performance on random arrays of data of sizes 10n for n = 2, 3, and 4. Create three graphs (one for the random data, one for the increasing data, and one for the decreasing data) to illustrate your results. Discuss these results.