Create a C++ Program

The file must be called [login to view URL] Create a structure called AddressNode 1. The structure should contain a string for name and a pointer called AddressNode that points to “next” (the next element in the list). Create classed called ABook. [login to view URL] the Default Constructure. (public) 2. Create the Deconstructor. (public) 3. AddressNode* topPtr. (private) – Should be a pointer to the top of the list. ABook Methods (each of these methods must be created in your program) 1. ABook::ABook() – Default Constructor 2. ABook::Insert(string NewItem) – Add item to the Linked List 3. ABook::SortedInsert(string NewItem) – Add item to the Linked List (sorted) 4. ABook::Remove(string& item) – Remove element from the top of the stack and return the item. 5. ABook::~ABook() – Deconstructor. Removes all elements from the list. Main Method 1. Declare new List (Hint: ABook Book;) 2. Declare new string newName. 3. Declare new string nameToRemove. 4. Call [login to view URL](“Precious”); - Insert Precious into list. 5. Call [login to view URL](“Ken”); - Insert Ken into listed (sorted) 6. Call [login to view URL](“Eileen”); - Insert Eileen into list (sorted) 7. Call [login to view URL](“Frank”); - Insert Frank into list (sorted) 8. Use [login to view URL] to remove each name one at a time and display to screen. [login to view URL]: system("PAUSE"); after your output to pause the screen. See example below. Example output of your program Sorted List: Eileen Frank Ken Precious