C++ please:

Question1: Write only the implementations of the friend list from the following friend.txt file

Consider your Node class, Iterator class and all functions of the List class, are implemented, except those asked below.

friend.txt

Jacob

Isabella

William

Emma

Jayden

1. Create a list by insertBegin() and insertEnd() of the names of the above friend list
2. Sort the list in descending order
3. Insert a new friend named Olivia at the correct position of the sorted list.
4. Create a function using iterator object to print the first three names of the list.
5. Overload the [] operator to output any name of the list by listObject[position]
6. Implement a function that will randomly pick a friend name from the list.
7. What linked data structures you would use if you have 60 candies to distribute in your original friend list. Write a traversal function for each if you have each Node,

void insertEachNode(); already implemented

1. Jacob, Isabella to Jayden and then Jayden, Emma to Jacob and so forth
2. Jacob, Isabella .to Jayden and to Jacob, Isabella to Jayden and so forth