11. An ordered linked list of characters has been constructed using the array-based mplementation. The following diagram has a linked list pointed by first where items are in alphabetical order and another linked list pointed by free that has available pool of nodes. Node data next iv. first-3 free = 5 first-3 0 free = 5 1 2 first-3 3 free = 5 4 5 Node 0 1 Write in order the contents (data) of the nodes of the linked list pointed by first. 2 List the address (index) of the nodes in the storage pool pointed by free in the order in which they are linked together. iii. Show the changes in the data and next members of the nodes and the values of first and free after the letter D is inserted in the linked list so that the linked list is still in alphabetical order. Make changes in this figure where necessary 3 4 5 Node 0 1 2 H 3 X 4 P E F 5 B 7 C M data H X P E F Show the changes in the data and next members of the nodes and the values of first and free after the front item of the linked list pointed by first (node index #3) is deleted. Make changes in this figure where necessary. B C M data H 2 6 X 0 1 P E F 4 B C -1 M next 2 6 0 1 4 next 7 2 6 0 1 4 -1

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.