Draw a graphical representation that shows the removing x from the linked list As a second example, we write a function insend(head , x) to insert the element x at the end of a linked list head. void insend(NODEPTR *head, int x) { NODEPTR P, q; p=getnode(); p->info = x; p->next = NULL; if (*head ==NULL) *head = p; else { for (q=*head; q->next !=NULL; q=q->next); q->next = p; } 10:19