G. A deque (double-ended queue) is an abstract data type similar to a queue, but where elements can be added and removed both from the front and the rear of the queue. Much like queues and stacks, deques can be implemented using arrays, circular arrays, singly or doubly linked lists, etc. Consider the following implementations ArrayDeque: a simple array implementation, which has an instance reference variable to the . CircularArrayDeque: a circular array implementation, which has an instance reference variable LinkedDeque: a (singly) linked list implementation, which has an instance reference variable to array, as well as an instance variable containing the number of elements in the array to the array, as well as instance variables for the current front and rear elements in the array the current head Node of the deque . DoublyLinkedDeque: a doubly linked list implementation, which has an instance reference vari able to the current head Node of the deque and an instance reference variable to the current tail Node of the deque, and doubly linked Nodes. For each of the four methods below, indicate for each implementation if the method can be Fast (that is, its execution time is constant) or if it will be Slow (that is, proportional to the number of elements in the list) Note that both array implementations are based on dynamic arrays, and thus can accommodate any number of elements. However, the array is not automatically shrunk ArrayDeque CircularArrayDequeLinkedDequeDoublyLinkedDeque void addFront(E elem) void addRear(E elem) E removeFront E removeRear0