Convert the following java code into mips

int [] a = {10,7,2,5,76,3,5,78,23,76,34,8,3,1,34,6};

n = a.length();

do{

newn = 0;

for (int i = 1 ; i< n; i++)

if (A[i-1] > A[i]){

int t = a[i];

a[i] = a[i+1];

a(i+1] = t;

newn = I;

}while (n <> 0);