f the image is too small please open it in a new tab for an enlarged view

please I want full explanation

Suppose head and p are pointers of linked list nodes. Explain the effect of the following code fragments: a) Node *temp = head; while (temp->next->next != NULL) temp = temp->next; free (temp->next); temp->next = NULL; b) Node P = new Node 0 ; p->next = head; head->next = c) Node p = new Node (), temp = head; while (temp->next !=NULL) temp semp->next; temp->next = p