5. Consider the memory organized as the 32-bit values in the following manner: Address 16 20 24 28 32 Data 32 14 23 Write the MIPS code to sort the data from lowest to highest, placing the lowest values in the smallest memory location. Repeat the same to sort the data from highest to lowest, placing the lowest values in the smallest memory location. 6. Consider that the variable a is assigned to register $s3 and the base address of the array X is in registers $s0. Develop an equivalent C code for the following MIPS instructions: addi $to, $s0, 4 add $t1, $s0, $0 sw $t1, 0(Sto) lw $to, o(Sto) add $s3, $t1, $t0