deque.push_front(6) 2 is at front of Deque, 3 is at back Deques: In the diagrams below list what data members you need to track and what their values are in its initial state and their state after each of the operations are applied to the diagram. If the array needs to be resized, draw the new array with the correct capacity 2 2 deque.push_back(6) 2 is at front of Deque, 3 is at back 23 deque.pop_back() deque.push_front(6) initially 2 is at front of deque, 5 is at back 2 3 4 3 4 deque.pop_front() deque.push_back(6) deque.pop_front() deque.push_back(7) initially 2 is at front of deque, 5 is at back 5 3 5 def push_front (self, data): This function adds data to the "front" of the Deque. Function does not return anything. When this operation causes the number of items stored to exceed the current capcity, a resizing operation will need to take place. Resizing always doubles the current capcity of the array. Runtime requirement for this function is O(1) when no resizing occurs, O(n) when resizing occurs def pop_front (self): This function removes the value from the "front" of the Deque. Function returns value removed. If the function is called on an empty Deque, raise the IndexError with this statement raise IndexError('pop_front() used on empty deque') Runtime requirement for this function is O(1) def push_back(self): This function adds data to the "back" of the Deque. Function does not return anything. When this operation causes the number of items stored to exceed the current capcity, a resizing operation will need to take place. Resizing always doubles the current capcity of the array. Runtime requirement for this function is O(1) when no resizing occurs, O(n) when resizing occurs def pop_back(self): This function removes the value from the "back" of the Deque. Function returns value removed. If the function is called on an empty Deque, raise the IndexError with this statement raise IndexError('pop_back() used on empty deque') Runtime requirement for this function is 0 (1) 4 r