assembly code

1. The C code for sort() in the textbook is wrong. A correct version is as follows: for(int i = 1; i < n; i++) { for(int j = 0; j < n - i; j++) { if (v[j] > v[j+1]) swap(v, j); Revise the assembly code for sort(), and insert your assembly code for sort() and swap() into the given program lab1.asm. You need to use SPIM to debug and run the program. Note that swap() and sort() should be two separate functions in the assembly code program. You are strongly suggested to re-use the code in Fig 2.25 and Fig. 2.27 as much as possible and change them only when it is indeed necessary, such as for correcting the error in sort(). 2. If your code does not run or produces result very different from correct one, your score would be substantially reduced. As an alternative, you can do a simplified version of the program, in which you only need to move the largest number in the array to the last position of the array. Note that in the result array, no element should be lost. Note that if you take this option you must explicitly place this statement at the beginning of the program “# THIS IS A SIMPLIFIED VERSION” and the highest score you may receive is 85 (out of 100 points). Without this statement, your code will be graded as a regular version. 3. Submit your source code ([login to view URL]) via the blackboard by the due time. 4. Start your work as early as possible.