For which of the following data structures does the method T…

For which of the following data structures does the method T get(int index) have a complexity of O(N) in the worst case, where N is the size of the list? Note: An ArrayList is implemented using an oversize array. ArrayList.get(int index) returns the element at the given index within the oversize array.

Adding an instance field size of type int to track the numbe…

Adding an instance field size of type int to track the number of elements stored in a singly-linked list optimizes the worst-case runtime complexity (from linear time to constant time algorithm) of which of the following operations defined in ListADT? Select all which apply.