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 (: p->next = head; head->next = p; c) Node p = new Node (), temp = head; while (temp->next !=NULL) temp = temp->next; temp->next P P