Write the code of this exercise in WINMIPS$64$ assembler.

To see the usefulness of indexed addressing, consider a simple example involving a list of test scores for students

taking a given course. Assume that the list of scores, beginning at location LIST. A $15-$word comprises a record that

stores the relevant information for each student. Each record consists of the student$$s identification number $($ID$),$

followed by the scores the student earned on $14$ tests. There are n $=50$ students in the class, and the value n is stored

in location N immediately in front of the list. The addresses given for the student IDs and test scores assume that the

memory is byte addressable and that the word length is $32$ bits. Each row contains the entries for one student, and

the columns give the IDs and test scores. Suppose that we wish to compute the sum of all scores obtained on $3,9,$

$12,$ tests, and store these four sums in memory locations SUM$3,$ SUM$12,$ SUM$9$