Assume you have a newly instantiated ArrayQueue, implemented as discussed in class, that uses an internal array that is 0-based and has an initial capacity of 10 items. Assume the following commands are executed in the order shown:

enqueue("Adrian Peterson");

dequeue(); enqueue("Devonta Freeman");

enqueue("Chris Johnson");

dequeue();

dequeue();

enqueue("Todd Gurley");

enqueue("Doug Martin");

enqueue("Latavius Murray");

enqueue("Frank Gore");

dequeue(); enqueue("Mark Ingram");

dequeue(); enqueue("Jonathan Stewart");

enqueue("Justin Forsett");

dequeue();

enqueue("Le'Veon Bell");

Indicate what the final state of the underlying array of the ArrayQueue is by matching the array index on the left with the value on the right that would be contained at that array index. Also indicate which item is at the front of the ArrayQueue and which item is at the rear of the ArrayQueue. The items on the right can be used more than once, if necessary, and there may be one or more items on the right that are not used.

0

A.	Adrian Peterson

1

B.	Mark Ingram

2

C.	Todd Gurley

3

D.	Doug Martin

4

E.	Devonta Freeman

5

F.	Justin Forsett

6

G.	Latavius Murray

7

H.	Chris Johnson

8

I.	Jonathan Stewart

9

J.	Le'Veon Bell

item at the front of the queue

K.	Frank Gore

_

item at the rear of the queue

L.

null