PLEASE DON'T JUST WRITE THE FOLLOWING ANSWER; WRITE FULL PROPER CODE

Y->next = X->next;

X->next = Y;

Question 1. [5 pts] Suppose that you're given the head pointer H to a singly-linked list, and a pointer X to one of the nodes in the list. You're now given a pointer to a new node Y. Write a C++ code to insert Y into the given linked list, just after the node X. Assume any reasonable structure for the nodes in the linked list (e.g., each node must have a "next" pointer pointing to the next item on the list)