Question 3.11 I need the following in C++ please Thank you

E Add notes 6 Assignment cs210 textbook.pdf x C Solved: Repeat Exercise, ma c Write Pseudocode To Swap + V 0 0 file:///C:/Users/ksimr/Desktop/cs210%20textbook.pdf cells. 136 of 654 | Contents - + Fit to width Page view A Read aloud L. IV , What I LLIC U TILITIC or your programu: TUW IS LIIC alluar pecu affected by the delete routine for large values of N(N > 100,000)? 3.7 Modify the Vector class to add bounds checks for indexing, 3.8 Add insert and erase to the Vector class. 3.9 According to the C++ standard, for the vector, a call to push_back, pop_back, insert, or erase invalidates (potentially makes stale) all iterators viewing the vector. Why? 3.10 Modify the Vector class to provide stringent iterator checking by making itera- tors class types rather than pointer variables. The hardest part is dealing with stale iterators, as described in Exercise 3.9. 3.11. Assume that a singly linked list is implemented with a header node, but no tail node, and that it maintains only a pointer to the header node. Write a class that includes methods to a. return the size of the linked list b. print the linked list c. test if a value x is contained in the linked list d. add a value x if it is not already contained in the linked list e. remove a value x if it is contained in the linked list 3.12 Repeat Exercise 3.11, maintaining the singly linked list in sorted order. 3.13 Add support for operator-to the List iterator classes. SAA % D (4) ENG 7:45 PM