Consider the following linked list node data type: Complete the implementation of the following function. It is given a

[answerhappygod]

Consider the following linked list node data type:
Complete the implementation of the following function. It isgiven a pointer to a Node, and should "merge" the Node with theNode ahead of it, “absorbing” its value. If there is no next Node,then the function has no effect. For example, if the originallinked list configuration is like this:
then after calling the merge function, the configuration will belike this:
Code to replace /* missing code 1 */:
Code to replace /* missing code 2 */:
Code to replace /* missing code 3 */:
Code to replace /* missing code 4 */:
Code to replace /* missing code 5 */: