Convert the following program into MIPS MARS

#include #include void fun(int *A, int i, int j){ // check division by 0 if(A[j]==0){ printf("Illegal operation, division by 0. "); } else{ int quotient = A[i]/A[j]; int remainder = A[i]%A[j]; printf("%d/%d:Quotient is %d, remainder is %d ", A[i], A[j], quotient, remainder); } } int main(){ // allocate an array of integer type with size 8 on heap int *A = (int*) malloc(8 * sizeof(int)); //pointer A holds the base address of this array int i = 0; // to count how many numbers has been entered int n; // to temporary hold user's input // ask user's input, while(i<8){ printf("Enter a natural number: "); scanf ("%d",&n); // scan the input and store it in variable n A[i]=n; i++; } // use to hold user's input int index1; int index2; printf("Enter an index: "); scanf ("%d",&index1); printf("Enter an index: "); scanf ("%d",&index2); // check boundary if(index1 < 0 || index1 > 7 || index2 < 0 || index2 > 7){ printf("Invalid input. Out of boundary. "); } else{ fun(A, index1, index2); } }