In Java, 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(1).

And explain what the memory looks like for a list stored as a [static array | dynamic array | linked list]. Make sure to represent the memory needed to store additional helper variables (such as size, head, etc.).