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. 2 3 4 MARIE program fragment: Address Label (Hex) 00D Addr, Hex ????/ Top of list pointer: Node2, Hex 0032 Node's data is the character "2" Node4, Hex 0034 Character "4" Nodel, Hex 0031 Character "1" Node3, Hex 0033 Character "3" Node5, Hex 0035 Character "5" / You fill in the address of Nodel 00E O0F 010 011 012 013 014 015 016 017 Hex????Address of Node3 Hex ???? Hex???? Hex ???? Hex 0000 Indicates terminal node 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. 2 3 4 MARIE program fragment: Address Label (Hex) 00D Addr, Hex ????/ Top of list pointer: Node2, Hex 0032 Node's data is the character "2" Node4, Hex 0034 Character "4" Nodel, Hex 0031 Character "1" Node3, Hex 0033 Character "3" Node5, Hex 0035 Character "5" / You fill in the address of Nodel 00E O0F 010 011 012 013 014 015 016 017 Hex????Address of Node3 Hex ???? Hex???? Hex ???? Hex 0000 Indicates terminal node