please answer the following questions

7. Explain the difference between a dynamic array list and a linked list. 8. Compare and contrast singly and doubly linked lists, including the pros and cons 9. Explain the difference between a "node" class and a "linked list" class. Include in 10. Explain what the memory looks like for a list stored as a [static array | dynamic of using them your description the terms: node, next, value, head, and tail. array | linked list]. Make sure to represent the memory needed to store . write the code to perform [set | get l add I append | insert | remove l contains l 12. Why we might want to have dummy head/tail nodes? Compare operations for 13. Explain why we say that the worst case big-O of appending to a dynamic array additional helper variables (such as size, head, etc) indexof] for a [dynamic array list | singly linked list | doubly linked list] linked lists w/ and wlo those dummy nodes, list is O(n) while its amortized cost is only O(l) 14. Given an array representing a list, write the code to convert the array into the 15. Write the code to perform an [insertion |selection] sort on a singly linked list 16. Describe how you make a class "iterable" in Java. What interfaces do you need? equivalent linked list. (with an optimal Big-O) What methods are required by those interfaces? Are there any additional optional methods? 17. Write code to implement a basic List iterator for an [array | linked list] and show how the iterator would be used