it the same option foe each step

The table below shows 32-bit values of an array stored in memory. Address Data 24 2 38 4 32 3 36 6 40 1 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. step1 step 2 [Choose] sw $t0, 16($56) lw $t2, 16($56) lw $t0, 12($56) lw $t1, 4($56) sw $t0, 4($56) lw $t0, 0($56) sw $t1, 12($56) sw $t2, 0($56) Choose step3 step4 step5 [Choose ] step6 [Choose ] step7 [Choose ] step8 [Choose ]