CDA-3102: Florida International University IP1 Part 3: Complete Sort Introduction In Part 2 of IP1, you completed the translation of three lines of Java to MIPS, and then to binary. These three lines, by themselves, swapped two array elements (nums[i] and nums [j]). In Part 3, you will surround your translation of this swap code with translations of conditionals and loops, to completely sort your array. 1. Selection Sort (MIPS) The selection sort algorithm works by making multiple passes through an array, each time keeping track of the index of the minimum element in a variable i). After the jth iteration, we swap the leftmost element (1) with this minimum value nums[i]. After size-1 iterations, the array is sorted. A single pass of selection sort is shown visually on Canvas (sel_sort.png). Implementing selection sort in Java requires two more loops, one if statement, and a couple of assignments. The code is below, with new portions highlighted in bold. int k; // Assume i, j, nums and size already declared for (j = 0; j = nums [k]) { i = k; } } int tmp = nums[i]; // Part 2 nums[i] = nums[i]; nums (j] = tmp; Your task for this project will be to translate the remaining portions to MIPS, which in the end should produce a sorted array of values