1 pts given that the worst-case runtime complexity of listadt get(int index) is o(n), when implemented using a doubly-linked list with both head and tail references, which of the following situations describes the worst case scenario for get(int index) in this doubly-linked list implementation? listadt get(int index) : returns the element at position index of the list. throws an indexoutofboundsexception if index is out of the range [0 .. size()-1].