PLEASE ANSWER ENTIRE QUESTION USING C++ PROGRAMMING LANGUAGE!!!!

Write a computer program that reads a series of positive integers, one per line, from the keyboard into a linked list. The user indicates that they are finished by entering -1 (the negative number is not stored in the list). Create two separate linked lists: List1 Front: nodes are inserted at the front of the list List2End: nodes are inserted at the end of the list Create the following functions: buildListFoward(Node Type* first) - adds to the tail of the list buildListBackward(Node Type* first) - adds to the head of the list print(NodeType* first) - prints the values in the list on one line separated by spaces Add the following functions using list1 linked list: search(int key, Node Type* first) - searches the list for a key value and returns true/false if the key is (not) in the list addNode(int key, NodeType* first) - add a single not to the end of the list deleteList(NodeType* first) - delete the entire list deleteNode(Node Type* first) - delete a node from the end of a list Note: for functions addNode() and deleteNode(), you should print the modified list Test your functions by calling them in main(). Write a computer program that reads a series of positive integers, one per line, from the keyboard into a linked list. The user indicates that they are finished by entering -1 (the negative number is not stored in the list). Create two separate linked lists: List1 Front: nodes are inserted at the front of the list List2End: nodes are inserted at the end of the list Create the following functions: buildListFoward(Node Type* first) - adds to the tail of the list buildListBackward(Node Type* first) - adds to the head of the list print(NodeType* first) - prints the values in the list on one line separated by spaces Add the following functions using list1 linked list: search(int key, Node Type* first) - searches the list for a key value and returns true/false if the key is (not) in the list addNode(int key, NodeType* first) - add a single not to the end of the list deleteList(NodeType* first) - delete the entire list deleteNode(Node Type* first) - delete a node from the end of a list Note: for functions addNode() and deleteNode(), you should print the modified list Test your functions by calling them in main()