What is the worst case Big O of the following Deque methods, when using a double linked list with references to the front and rear. public boolean isEmpty public void clear(); public int size() public void addFirst(T newEntry); public T peekFirst() public T removeFirst(); public void addLast(T newEntry); public T removeLast() public T peekLast(); public T [] toArray()