Suppose you implement a deque inside of a circular array with 7 cells. Assuming that the first insertion occupies cell 0, and that the front grows to the left and the back grows to the right, show the contents of the array after the following operations:

push_front(7) push_front(14) push_front(2) pop_back() push_front(83) push_front(52) pop_back() pop_back() push_front(95) push_back(77)