1. Explain (with a drawing) what the memory looks like for a list stored as a dynamic array list. Make sure to represent the memory needed to store additional helper variables 2. Write the pseudocode for insert() for a dynamic array list with generic type T. 3. Explain why we say that the worst case big-O of appending to a dynamic array list is O(n) while its amortized cost is only O() covered in readings this week, or lecture next week] 4. Describe how you make a class "iterable" in Java. What interfaces do you need? What methods are required by those interfaces? Are there any additional optional methods? 5. Write code to implement a basic iterator for a dynamic array list. 1. Explain (with a drawing) what the memory looks like for a list stored as a dynamic array list. Make sure to represent the memory needed to store additional helper variables 2. Write the pseudocode for insert() for a dynamic array list with generic type T. 3. Explain why we say that the worst case big-O of appending to a dynamic array list is O(n) while its amortized cost is only O() covered in readings this week, or lecture next week] 4. Describe how you make a class "iterable" in Java. What interfaces do you need? What methods are required by those interfaces? Are there any additional optional methods? 5. Write code to implement a basic iterator for a dynamic array list