A linked list is a linear Data structure consisting of a set of nodes, were each one except the last point to the next node in the list. Suppose we have the set of five nodes as 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. Assume the nodes are stored in memory and fill in the ???? In the program fragment below appropriately.

in the program fragment below appropriately. traverse the list and print the data in order as stored in each node. Assume the node Data Next MARIE program fragment Address (Hex) /Top of list pointer (you fill address of Nodel) Addr, 00D /Node's data is the character 12 Node2, 00E /Address of Node3 Hex 00F 010 Nodes, Hex oos Character 4 Address of Nodes Character 0031 odel. /Address of Mode2 /Character 0033 Node Address of Node Hex character ,5, 0035 016 Indicates terminal node