Convert this C program into MIPS assembly language. Include a screenshot of the output to show it works! Thanks

#include  int data[] = { 46,78,19,16,40,86,72,54,1,24,77,97,96,17,45,99,6,77,38,60, 16,66,65,37,2,91,30,29,53,75,31,47,65,57,65,66,13,64,45,24 }; void quickSort(int arr[], int left, int right) { int i = left, j = right; int tmp; int pivot = arr[(left + right) / 2]; /* partition */ while (i <= j) { while (arr[i] < pivot) i++; while (arr[j] > pivot) j--; if (i <= j) { tmp = arr[i]; arr[i] = arr[j]; arr[j] = tmp; i++; j--; } }; /* recursion */ if (left < j) quickSort(arr, left, j); if (i < right) quickSort(arr, i, right); } void main() { quickSort(data, 0, 39); for(int i=0; i<40; i++) { printf("%d %d ", i, data[i]); } }