An ordered linked list of characters has been constructed using the array-based implementation. The following array is used for the linked lists where items are stored in alphabetical order and an available pool of nodes.

i. List the nodes in the storage pool pointed by free in the order in which they are linked together. Write the addresses (index) of the available nodes. ii. Show the changes in the data and next members of the nodes and the values of first and free after the letter I is inserted in the linked list so that the linked list pointed to by first remains in alphabetical order. Make changes in this fiqure where necessary. \begin{tabular}{|c|c|c|c|} \hline & & & \\ \hline & 0 & T & -1 \\ \hline free =1 & 1 & Y & 3 \\ \hline & 2 & H & 6 \\ \hline & 3 & B & 5 \\ \hline first =4 & 4 & C & 2 \\ \hline & 5 & J & 7 \\ \hline & 6 & M & 0 \\ \hline & 7 & N & -1 \\ \hline \end{tabular} Show the changes in the data and next members of the nodes and the values of first and free after the last item of the linked list pointed to by first is deleted. Make changes in this figure where necessary.