Write a MIPS program that uses a recursive implementation of quick sort to sort an array of numbers. The values of the array will be given to you via standard input. The rst number will be the number of elements in the array and followed by the elements of the array in order. You can assume that there will be no more than 20 numbers and each number will t in a signed 4 byte integer. After sorting the numbers, you should write them to standard out in increasing order. Your code should be able to handle an array with numbers that have the same value.
You must use the C implementation of quick sort listed at the end of this assignment description as the basis for your MIPS implementation.