A linked list is a linear data structure consisting of a set of nodes, where each one except the last one points to the next node in the list. (Appendix A provides more information about linked lists.) Suppose we have the set of 5 nodes shown in the illustration below. These nodes have been scrambled up and placed in a MARIE program as shown below. Write a MARIE program to traverse the list and print the data in order as stored in each node. MARIE program fragment: Address Label (Hex) 00D Addr, Hex ???? / Top of list pointer: / You fill in the address of Node1 00E Node2, Hex 0032 / Nodes data is the character 2 00F Hex ???? / Address of Node3 010 Node4, Hex 0034 / Character 4 011 Hex ???? 012 Node1, Hex 0031 / Character 1 013 Hex ???? 014 Node3, Hex 0033 / Character 3 015 Hex ???? 016 Node5, Hex 0035 / Character 5 017 Hex 0000 / Indicates terminal node