Write a function called removeFirstOf3 that removes the firs…
Write a function called removeFirstOf3 that removes the first value in successive groups of three from a list of integers, returning those values in their original order as a new list. For example if a variable called list1 stores these values: | | | | | | +——+ +——+ +——+ group group group Then the following call: LinkedList list2 = list1.removeFirstOf3(); Should result in list1 and list2 storing the following values: list1: {19, 7, -2, 8, 18, 42}list2: {3, 45, 6, 5} Notice that the values stored in list2 are the values that were the first value in each of the groups of three in the original list. When a list has one or two values at the end that are not part of a group of three, then the first of those values is removed and included in the new list, as with the value 5 in the example above. You are writing a member function for a linked list class defined as follows: struct ListNode { int data; // data stored in this node ListNode* next; // link to next node in the list }; class LinkedList { private: ListNode* front; public: }; You are writing a function that will become part of the LinkedList class. You may define private helper functions to solve this problem, but otherwise you may not assume that any particular functions are available. You are allowed to define your own variables of type ListNode*, but you may not construct any new nodes, and you may not use any auxiliary data structure to solve this problem (no array, vector, list, stack, queue, string, etc). You also may not change any data members of the nodes. You MUST solve this problem by rearranging the links of the list. Remember that you can access the member variables of any LinkedList, including a passed in one or newly created one, from inside the LinkedList class.