Intro to Computer Architecture Spring, 2017 Due: March 8 (midnight) Write a program to implement doubly-linked lists of integers in MIPS assembly language Your implementation will include functions to insert an integer at the end of a given linked list display the contents of a list in forward order display the contents of a list in reverse order A "list" should be stored as a struct consisting of two addresses: a pointer to the head of the list and a pointer to the tail of the list. You can create an empty list in your data section with the directive list: word 0, 0 A nodes is a struct consisting of three words: a data item, a prior pointer, and a next pointer. Use a value of 0 to indicate a null pointer. Allocate space for list nodes as follows: Each node is 12 bytes (4 bytes each for data, prior, next). Use the spark system call (v0 = 9) to allocate space for each node. a0 is a parameter to spark containing the number of bytes requested. the address of the requested space is returned in v0