1. What are the big-O run-times of the Get and Set operations for an array-based list? Do your empirical results agree with this? Why or why not?
2. What is the big-O run-time of the Remove operation for an array-based list? Do your empirical results agree with this? Why or why not?
3. What are the big-O run-times of the Get and Set operations for a linked-list? Do your empirical results agree with this? Why or why not?
4. What is the big-O run-time of the Add operation for an array-based list? Do your empirical results agree with this? Why or why not?