#include

using namespace std;

int Partition(int * A, int start, int end) {

int pivot = A[end];

int partitionIndex = start;

for (int i = start; i

if (A[i]<=pivot) {

swap(A[i],A[partitionIndex]);

partitionIndex++;

}

}

swap (A[partitionIndex],A[end]);

return partitionIndex;

}

void QuickSort(int * A, int start, int end) {

if (start

int partitionIndex = Partition(A,start,end);

QuickSort(A, start, partitionIndex-1);

QuickSort(A, partitionIndex+1,end);

}

}

int main () {

int A[] = {7,6,5,4,3,2,1,0};

QuickSort(A,0,7);

for (int i = 0; i<8;i++) cout <

}

Can someone please convert this to MIPS PLEASE!!! thank you !!!!