3. (Project) Quicksort is an algorithm that sorts an array of n (distinct) numbers in O(n log n) time.

The algorithms psuedo-code can be found right under Hoare partition scheme at the following wiki-page: https://en.wikipedia.org/wiki/Quicksort

Please translate the psuedo-code into MIPS and make sure your resulting MIPS program indeed works by running it on the following array of seven numbers:

10, 2, 17, 9, 6, 4, 8 and printing the sorted array on the terminal, that should be 2, 4, 6, 8, 9, 10, 17.