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.