How do you use the bottom-up approach method to sort an unorder array with sublists?

Question

For example, if the sorting program takes (6, 5, 9, 1, 7, 0, -3, 2) as input, it will produce a sorted list (-3, 0, 1, 2, 5, 6, 7, 9)

The order should be like this right? 8 -> 2, 2, 2, 2 -> 4, 4 -> 1(this is output). MIPS is confusing when you branch instructions around if else statement. I got C and java, but mips...

mergesort in C