Delete a node WITHOUT using the HEAD pointer.

 /*Delete a node WITHOUT using the HEAD pointerPARAM p: A pointer pointed to a node in the middle of the linked list.RETURN: void */void Delete(Node* p){ Node* q = p->next; while (q->next != NULL) { p->value = q->value; p = q; q = q->next; } p->value = q->vaule; free(q); p->next = NULL;}