Please show the steps, I do rate the answer!

In the following problems, we will be investigating memory operations in the con- text of an MIPS processor. The table below shows the values of an array stored in memory. Assume the base address of the array is stored in register $s6 and offset it with respect to the base address of the array a. Address Data 20 24 28 32 34 4 5 1 b.Address 24 38 32 36 40 Data 2 4 3 1 2.5.1 [10] For the memory locations in the table above, write C code to sort the data from lowest to highest, placing the lowest value in the smallest memory location shown in the figure. Assume that the data shown represents the C variable called Array, which is an array of type int, and that the first number in the array shown is the first element in the array. Assume that this particular machine is a byte-addressable machine and a word consists of four bytes 2.5.2 [10] For the memory locations in the table above, write MIPS code to sort the data from lowest to highest, placing the lowest value in the smallest memory location. Use a minimum number of MIPS instructions. Assume the base address of Array is stored in register $s6. 2.5.3 [5] To sort the array above, how many instructions are required for the MIPS code? If you are not allowed to use the immediate field in 1w and sw instructions, how many MIPS instructions do you need