Please use SPIM

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[1-A [i]-1 ; If its index i is odd, perform A [i] = Ali] + 2 * i. Swap the elements A12] with A[17, Print out the resulting array. Count how many cycles needed to execute your program and write it down in readme.txt (Note: an efficient program means use as less cycles as possible, but not necessary to be minimum # of cycles.) a. b. and A[19-il, such that, i.e. A[0] with A[19],A[1] with A[18], c. d. e