Th e table below shows 32-bit values of an array stored in memory. Address Data 24 2 38 4 32 3 36 6 40 1 a. For the memory locations in the table above, write C code to sort the data from lowest to...

Th e table below shows 32-bit values of an array stored in memory.

Address   Data

    24         2
    38         4
    32         3
    36         6
    40         1


a. 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.
b. 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.