Using MIPS assembly language and SPIM simulator. Also, add comments and a picture of the output.

Problem 2. Write an efficient algorithm to perform the following tasks: (20 pts) Create an array A of size 20, where all the array elements are initialized to 4. For every element in the array, if its index is even, perform A[i] = A[i]-1 ; If its index iis odd, perform Ali-Ali] +2+1. a. b. c. Swap the elements Ali] and A[19-, such that, i.e. A[O] with A[19], AL1] with A[18], A12] with A[17], Print out the resulting array. Count how many cycles needed to execute your program and write it down in Note: an efficient program means use as less cycles as possible, but not necessary to be minimum # of cycles.) d. e. readme.txt