Figure 5-28 shows an empty list with a dummy node. Write the code to add a node to this empty list. Write the code to delete a node in the middle of a list implemented as a linked list with the dummy...

Figure 5-28 shows an empty list with a dummy node. Write the code to add a node to this empty list.

Write the code to delete a node in the middle of a list implemented as a linked list with the dummy node (see Exercise 3). Compare your answer with the answer to Exercise 3. Are they the same? What do you conclude? Does the dummy node simplify the operation on a list? How?