Consider the linked list shown in Figure 16-50. Assume that the nodes are in the usual i...

Consider the linked list shown in Figure 16-50. Assume that the nodes are in the usual info-link form. Use this list to answer Exercises 6 through 14. If necessary, declare additional variables. (Assume that list, current, temp, trail, and last are pointers of type nodeType.)

Write C++ statements to do the following:

a. Write a C++ code so that current traverses the entire list.

b. Create the node with info 68 and insert between trail and last.

c. Delete the last node of the list and also deallocate the memory occupied by this node. After deleting the node, make last point to the last node of the list and the link of the last node must be NULL.

d. Delete the node with info 10. Also, deallocate the memory occupied by this node.