7. 100% Sorting numbers is a very common problem; here, you just have 3 numbers to sort.
This MIPS/SPIM program includes a subroutine called myadd that performs x=(y+z);. In
the space below, replace the myadd subroutine with one named mysort that will sort the
values of x, y, and z and into increasing order (i.e., make x the smallest and z the largest).
(Hint: your code may take advantage of the fact that x, y, and z are consecutive words in
memory.) You should test your routine using SPIM before you submit it, which will require
merging it with a test framework like the one used in this MIPS/SPIM program but only
submit the mysort routine here.
####
#
# Addition routine:
#
# x = y + z
#
.text
.globl myadd
myadd:
la $t0, y # t0 = y
lw $t0, 0($t0)
la $t1, z # t1 = z
lw $t1, 0($t1)
addu $t2, $t0, $t1 #t2 = y + z
la $t0, x # x = t2
sw $t2, 0($t0)
jr $ra # return