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"Jthan 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 ArrayOueue 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 B. Mark Ingram C. Todd Gurley D. Doug Martin E. Devonta Freeman F Justin Forsett G. Latavius Murray H. Chris Johnson l. Jonathan Stewart J. Le Veon Bell K. Frank Gore L. null # item at the front of the queue # item at the rear of the queue