Quick Sort Recursive Function The function quick_sort sorts an array of integers recursively. Translate this function into MIPS code. Write a read_array function that asks the user to input the number of elements n (must be greater than 1), allocates an array of n integers dynamically on the heap, reads n integers and stores them in the array, and returns the address of the allocated array and the number of elements in $v0 and $v1, respectively. Write a function print_array that prints an array of n integers. Write a main function that calls the functions read_array, print_array (before sorting), quick_sort, and print_array (again after sorting). Test your program by entering different arrays and check if sorting works properly. void quick_sort(int array[], int n ) \{ int i=0;//i= low index int j=n1;//j= high index int pivot =array[(i+j)/2];// pivot = middle value while (i pivot) j; if (i0) quick_sort(\&array[0], j+1); // Recursive call 1 if (i<1>