the beginning is the last photo the first photo is the second part and last last part is the middle photo

correction last photo is first top is the middle and second is last

I need help with the code for this program

I would the user to input the information

c++ please

1:50 * + Expert Q&A D + element. back() const: T: Returns the last element. Return to the Books object. Return to your Books code. Find Books.h and remove the import statements to "vector.hpp and replace those with the local version of "LinkedList.hpp" that you made. Add a menu option to add to the beginning of the list. Add a menu option to remove the first Book in the list. Add a menu option to remove the last Book in the list. Add a menu option to remove every Book in the list. Test your linked list application. Add a Book to the list 1,000 times. Add a second Book to the list 1,000 times. Remove the first Book in the list. Remove the last Book in the list. Verify that you have 1,998 Books in the list. After you verify that there are 1,998 Books in the list, clear the list using your newest menu option. Verify that you have 0 Books in the list. 1:49 + Expert Q&A 0 + Your LinkedList class must also support the following public member functions. LinkedList(): A default constructor sets both pointers to null and sets the size to 0. LinkedList(const LinkedList&): A copy constructor that takes a LinkedList object and performs a deep copy of the passed list into this list. -Linked List(): A destructor that performs pop_front on the list while the list is not empty. operator=(const LinkedList&): LinkedList& An overloaded assignment operator that deletes the current array and replaces it with deep copy of the passed list. .size() const: int: Returns the size of the LinkedList. push_back(const T): void: Creates a new Node and assigns it to the end of the list of Nodes while updating the size by 1. push_front(const T): void: Creates a new Node and assigns it to the front of the list of Nodes while updating the size by 1. pop_back(): T: Deletes the Node at the 1:49 4 + Expert Q&A W + The Node class must be represented as a template. The Node class will require these private fields. T data: The data to hold in the Node Node* next: A pointer to the next Node (if any) in the chain of Nodes. Node* prev: A pointer to the previous Node (if any) in the chain of Nodes. Linked List This class will require the following fields: Node* mHead: Points the first Node in the chain Node* m Tail: Points the last Node in the chain int mSize: keeps a count of the number of Nodes in the chain Your LinkedList class must also support the following public member functions. LinkedList(): A default constructor sets both pointers to null and sets the size to 0. LinkedList(const LinkedList&): A copy constructor that takes a LinkedList object and performs a deep copy of 1:49 4 + Expert Q&A W + The Node class must be represented as a template. The Node class will require these private fields. T data: The data to hold in the Node Node* next: A pointer to the next Node (if any) in the chain of Nodes. Node* prev: A pointer to the previous Node (if any) in the chain of Nodes. Linked List This class will require the following fields: Node* mHead: Points the first Node in the chain Node* m Tail: Points the last Node in the chain int mSize: keeps a count of the number of Nodes in the chain Your LinkedList class must also support the following public member functions. LinkedList(): A default constructor sets both pointers to null and sets the size to 0. LinkedList(const LinkedList&): A copy constructor that takes a LinkedList object and performs a deep copy of 1:49 + Expert Q&A 0 + Your LinkedList class must also support the following public member functions. LinkedList(): A default constructor sets both pointers to null and sets the size to 0. LinkedList(const LinkedList&): A copy constructor that takes a LinkedList object and performs a deep copy of the passed list into this list. -Linked List(): A destructor that performs pop_front on the list while the list is not empty. operator=(const LinkedList&): LinkedList& An overloaded assignment operator that deletes the current array and replaces it with deep copy of the passed list. .size() const: int: Returns the size of the LinkedList. push_back(const T): void: Creates a new Node and assigns it to the end of the list of Nodes while updating the size by 1. push_front(const T): void: Creates a new Node and assigns it to the front of the list of Nodes while updating the size by 1. pop_back(): T: Deletes the Node at the 1:50 * + Expert Q&A D + element. back() const: T: Returns the last element. Return to the Books object. Return to your Books code. Find Books.h and remove the import statements to "vector.hpp and replace those with the local version of "LinkedList.hpp" that you made. Add a menu option to add to the beginning of the list. Add a menu option to remove the first Book in the list. Add a menu option to remove the last Book in the list. Add a menu option to remove every Book in the list. Test your linked list application. Add a Book to the list 1,000 times. Add a second Book to the list 1,000 times. Remove the first Book in the list. Remove the last Book in the list. Verify that you have 1,998 Books in the list. After you verify that there are 1,998 Books in the list, clear the list using your newest menu option. Verify that you have 0 Books in the list. 1:50 * + Expert Q&A D + element. back() const: T: Returns the last element. Return to the Books object. Return to your Books code. Find Books.h and remove the import statements to "vector.hpp and replace those with the local version of "LinkedList.hpp" that you made. Add a menu option to add to the beginning of the list. Add a menu option to remove the first Book in the list. Add a menu option to remove the last Book in the list. Add a menu option to remove every Book in the list. Test your linked list application. Add a Book to the list 1,000 times. Add a second Book to the list 1,000 times. Remove the first Book in the list. Remove the last Book in the list. Verify that you have 1,998 Books in the list. After you verify that there are 1,998 Books in the list, clear the list using your newest menu option. Verify that you have 0 Books in the list. 1:49 + Expert Q&A 0 + Your LinkedList class must also support the following public member functions. LinkedList(): A default constructor sets both pointers to null and sets the size to 0. LinkedList(const LinkedList&): A copy constructor that takes a LinkedList object and performs a deep copy of the passed list into this list. -Linked List(): A destructor that performs pop_front on the list while the list is not empty. operator=(const LinkedList&): LinkedList& An overloaded assignment operator that deletes the current array and replaces it with deep copy of the passed list. .size() const: int: Returns the size of the LinkedList. push_back(const T): void: Creates a new Node and assigns it to the end of the list of Nodes while updating the size by 1. push_front(const T): void: Creates a new Node and assigns it to the front of the list of Nodes while updating the size by 1. pop_back(): T: Deletes the Node at the 1:49 4 + Expert Q&A W + The Node class must be represented as a template. The Node class will require these private fields. T data: The data to hold in the Node Node* next: A pointer to the next Node (if any) in the chain of Nodes. Node* prev: A pointer to the previous Node (if any) in the chain of Nodes. Linked List This class will require the following fields: Node* mHead: Points the first Node in the chain Node* m Tail: Points the last Node in the chain int mSize: keeps a count of the number of Nodes in the chain Your LinkedList class must also support the following public member functions. LinkedList(): A default constructor sets both pointers to null and sets the size to 0. LinkedList(const LinkedList&): A copy constructor that takes a LinkedList object and performs a deep copy of 1:49 4 + Expert Q&A W + The Node class must be represented as a template. The Node class will require these private fields. T data: The data to hold in the Node Node* next: A pointer to the next Node (if any) in the chain of Nodes. Node* prev: A pointer to the previous Node (if any) in the chain of Nodes. Linked List This class will require the following fields: Node* mHead: Points the first Node in the chain Node* m Tail: Points the last Node in the chain int mSize: keeps a count of the number of Nodes in the chain Your LinkedList class must also support the following public member functions. LinkedList(): A default constructor sets both pointers to null and sets the size to 0. LinkedList(const LinkedList&): A copy constructor that takes a LinkedList object and performs a deep copy of 1:49 + Expert Q&A 0 + Your LinkedList class must also support the following public member functions. LinkedList(): A default constructor sets both pointers to null and sets the size to 0. LinkedList(const LinkedList&): A copy constructor that takes a LinkedList object and performs a deep copy of the passed list into this list. -Linked List(): A destructor that performs pop_front on the list while the list is not empty. operator=(const LinkedList&): LinkedList& An overloaded assignment operator that deletes the current array and replaces it with deep copy of the passed list. .size() const: int: Returns the size of the LinkedList. push_back(const T): void: Creates a new Node and assigns it to the end of the list of Nodes while updating the size by 1. push_front(const T): void: Creates a new Node and assigns it to the front of the list of Nodes while updating the size by 1. pop_back(): T: Deletes the Node at the 1:50 * + Expert Q&A D + element. back() const: T: Returns the last element. Return to the Books object. Return to your Books code. Find Books.h and remove the import statements to "vector.hpp and replace those with the local version of "LinkedList.hpp" that you made. Add a menu option to add to the beginning of the list. Add a menu option to remove the first Book in the list. Add a menu option to remove the last Book in the list. Add a menu option to remove every Book in the list. Test your linked list application. Add a Book to the list 1,000 times. Add a second Book to the list 1,000 times. Remove the first Book in the list. Remove the last Book in the list. Verify that you have 1,998 Books in the list. After you verify that there are 1,998 Books in the list, clear the list using your newest menu option. Verify that you have 0 Books in the list