The worst-case runtime complexity of ListADT's get(int index) operation when the ListADT is implemented as a doubly linked list defined by its BOTH head and tail references is OCN). Which of the following situations is the worst case scenario for get(int index)? ListADT's get(int index) : returns the element at the position index of the list. throws an IndexOutOfBoundsException if index is out of the range [O..size()-1]. the element is not in the list the element is in the exact middle of the list the element to get is the first element in the list