Suppose head and p are pointers of linked list nodes. Explain the effect of the following code fragments: 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 c Node o new Node (), *temp = head; while (temp->next !=NULI) an temp->next; temp->next