Create the algorithm in MIPS. also have comments.

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 1 is even, perform Ali] = Ali]-1 ; If its index i is odd, perform Ali] - Ali] 2 i. Swap the elements A[i] and A [19-j. such that, i.e. A [O] with A[19]. A[1] with A[18], A[2] 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. c. d. e