for the memory location in the table below,write

2.6 The table below shows 32-bit values of an array stored in memory For the memory locations in the table below, write pseudocode to move the array locations around so that they are sorted lowest to highest. Use temporary variable names Templ, Temp2, Temp3, etc. as needed. Don't try to write in MIPS assembly, write in C, for example: A[ 1 ] A[ 2 ] or Templ A[1] or AI1]-Templ a. Assume that this particular machine uses byte-addressable RAM and a word size of four bytes exactly as we have discussed in class. Complete the table below first and then write code to implement the final column. Present Value Byte Address &24 &28 &32 Array Index New From Array Value Index Page 1 of 7 COSC 2440 Computer Organization and Architecture &36 &40 A13 b. [5] For the memory locations in the table above, write MIPS code to sort the data from lowest to highest, placing thelowest value in the smallest memory location. Use a minimum number of MIPS instructions, Assume the base address of Array is stored in register $so Hint: Remember you'll be repeatedly moving the contents around of a word of memory starting at some 4-byte multiple added to $so. So the first is o($so) and putting that value into $to, for example, would be a line of MIPS code that looks like this: lw $to, 0 (Ss0) Minimize instructions, not temporary variables. I was able to sort the array in 10 instructions, and the line above was my first line of code