please provide linked list. see more details below

Objectives: - Demonstrate a working singly linked list - Demonstrate sufficient knowledge to convert a single linked list into a doubly linked list Assignment: In class, we have learned about singly linked lists. For this challenge, you must write a program that implements a singly linked list derived from the code provided in class. A series of function calls and their subsequent output are included below. You must demonstrate a working singly linked list to the TA. That's it (almost). As part of the demonstration process, the TA will also ask you to modify your singly linked list code such that it becomes a doubly linked list. You will also be asked to add tailDisplay and tailRemove functions that perform display and remove functions starting from the tail of your doubly listed list. Base these functions on the existing display and remove functions provided in class. DO NOT BRING DOUBLY LINKED LIST CODE FOR DEMONSTATION. Do, however, practice and study the differences between the singly and doubly linked lists. Variable renaming features and search/replace in your IDE are not permitted for the demo. Example Testing Code: LinkedList LL; LL. append (5); LL , append (33) ; LL. append (1) ; LL , append (7); LL. append (33) ; LL. append (12); LL. display ( cout); LL, remove (33); LL. display ( cout); LL.prepend (12); LL. display ( cout) ; LL, remove (13) ; Li. display ( cout); LL. taildisplay ( cout ); LL.tailRemove ( 12 ); LL, display ( cout)