In this project, we will use MARS (MIPS Assembler and Runtime Simulator). You can write MIPS assembly code in its built-in editor, assemble and run code by using its assembler and simulator. MARS is written in Java.

3.4 Merge Sort Merge sort(See https://en.wikipedia.org/wiki/Merge_sort) is one of the classic sorting algo- rithms. The idea of merge sort is to constantly merge small pieces of sorted list into bigger ones. Implement merge sort to sort a pre-defined array in your data segment in ascending order. The sorted results should be saved in a pre-defined memory space. You can define your input in the data segment as shown below: .data length: .word 10 nums: .word 10,9,8,7,6,5,4,3,2,1 sorted: .word 0:10 In this example, you should save the sorted array to the memory space pointed by the label sorted. You are also welcome to save the sorted array back to nums. Please note that merge sort can be implemented iteratively or recursively. If you decide to use a recursive implementation, make sure you handle the call stack correctly