If you have the following node declaration: struct Node { int number; struct Node * next; }; typedef struct Node node; node *head,*newNode; Write a C program that contains the following functions to manipulate this linked list : 1. First function: Adding the odd numbers to the beginning of the list and even numbers to the end of the list until -1 is entered from keyboard. 2. Second function using given prototype below. This function cuts the last node of the list and adds it to the beginning as first node. It takes beginning address of the list as a parameter and returns the updated list. node* cutlastaddhead(node* head); 3. 3° function deletes the element in the middle of the list (free this memory location) (if the list has 100 or 101 elements, it will delete the 50th element). The function will take a list as a parameter and return the updated list.

C++ Splitlists( listType& list1, listType& list2，ItemType item) Function: Divides list into two lists according to the key of item. Precondition: list has been initialized and is not empty. Postconditions: list1 contains all the items of list whose keys are less than or equal to item key. List2 contains all the items of list whose keys are greater than items key. driver (.cpp) file in which you declare two objects of class Unsorted List one of which containsintegers into info part and the other one contains characters into info part. Both objects should not haveless than 20 nodes. a. Implement splitLists as a member function of the Unsorted List ADT. #include<iostream>#ifndef UNSORT_H#define UNSORT_Htemplate <class ItemType>struct NodeType{   ItemType info;   NodeType* next;};template <class ItemType>class UnsortedType{public:   UnsortedType();   ~UnsortedType();   bool full() const;   int lengthIs() const;   void makeEmpty();   void retrieveItem(ItemType&…