translate to MIPS then from MIPS to BINARY

example:

Task: At the point in IP1.part2.asm marked "PUT INSERTION SORT CODE HERE", translate the following lines: for ( i=1;i=0&&arr[j]> element ){ arr[j+1]=arr[j]; j=j1; \}arr[j+1]=e ement; Note: You can assume that the starting address of arr is in $S0, and N is in $s1. I have already populated arr with values and assigned N to its size. As an example: The binary translation of the above beq would be: 000100 10000010000000000000000011 beq \$so $to3 The binary translation of the above j would be: 000010 00000000000000000000000001 j 1<>