2. (20 points) Write a program in MIPS assembly that reads in an integer 010, followed by that number of integers. These should be stored into a linked list in the order they are read (first number at the front, then the second number, etc). The list should be printed, reversed using a translation of the code below, and then printed again.

Node newFirst = null; while(first != null) { Node second = first.next; first.next = newFirst; newFirst = first; first = second; }

Your solution should use a linked list and a translation of this code; you dont get full credit just for printing the numbers and printing them in reverse.