We are given a linked list in the following order: -> -> 1 -> 2 -> 3 and we wish to modify the given linked list to the following order: -> 1 -> 3 -> -> 2 Your task is to finish implementing the function modifyLinkedlist() such that the function performs the modification as specified above.modifyLinkedList() takes the head pointer of a linked list, and returns a head pointer of the rearranged linked list. Your code doesn't have to solve a general problem--it just needs to transform the given list into the modified list. The linked list nodes are defined as: struct Node { const int data; Node* next; Node(int d) : data(d), next(NULL) {} }; Note that you cannot change the data contained in a node