2) Assume there is a struct type Node with members Node * next and int value. Recall, a singly linked list is a sequence of Nodes in which each Node's next pointer is assigned the address of the Node that follows it. The data in a linked list is simply values in each Node. Write a linked list function void insertNext (Node * current, int newValue) that inserts a new Node with the given new value right after the node pointed to by current. That means current's next pointer should point to the new Node and the new Node's next pointer should point to the Node after current (or be null if current's next pointer is null)