Assuming that last points to the last element in the linked list, write the code segment required to append a node to the end of this list.

Refer to the following declarations

```
struct node
{
int item;
node *link;
}
node *p, *head, *last;
int saveItem;
```

```
if (head != NULL)
{
saveItem = head->item;
p = head;
head = head->link;
delete p;
}
```