Question 11 Not yet answered Consider how to implement a Deque as an SLList. The runtimes of the four Deque operations would be: Marked out of 1.00 Select one: P Flag question O a. O(1) addFirst(x), addLast(x), and removeFirst(); O(n) removeLast() O b. O(1) addFirst(x), addLast(x), and removeLast(); O(n) removeFirst() O c. O(1) addFirst(x) and addLast(x); O(n) for one of removeFirst() or removeLast(), O(1) for the other depending on which end of the SLList we make the first element of our Deque. O d. O(1) addFirst(x) and addLast(x); O(n) removeFirst() and removeLast() O e. O(1) addFirst(x), addLast(x), removeFirst(), and removeLast() O f. O(n) addFirst(x), addLast(x), removeFirst(), and removeLast()