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