These questions are about Data Structures. I need very short answers for below questions.

10. What are good boundary values to test the remove_current function? 11. Write a demonstration program that asks the user for a list of family member ages, then prints the list in the same order that it was given. 12. Write a new member function to remove a specified item from a sequence. The function has one parameter (the item to remove) 13. For a sequence of numbers, suppose that you attach 1, then 2, then 3, and so on up to n. What is the big-O time analysis for the combined time of attaching all n numbers? How does the analysis change if you insert n first, then n-1, and so on down to 1-always using insert instead of attach