Problem II Definition:

An electronic device store sells only Peach and Cyborg mobile devices and the way business is

performed is on a strictly "first in$,$ first out" $($FIFO$)$ basis. Customers must buy the "oldest" $($based on

arrival time$)$ of all the mobile devices in the store, or they can select whether they would prefer a Peach

or a Cyborg device $($and will receive the oldest device of that type$).$ They cannot select which specific

device within each brand.

Task A $(50\%)$:

$1-$ Create queue data structures under the class CellDeviceStore to maintain this system and

implement operations such as enqueueDevice, dequeueAnyDevice, dequeuePeach and

dequeueCyborg. The interface of this class is provided by the attached file interface

Assigment$3$Store.

Make your implementation of CellDeviceStore to implement this interface. Make the class that you

create for this exercise to be part of the package csu.datastructures.lab$3.$

You can use the implementations of queues provided by the Java API to solve this exercise or use the

LinkedQueue class you implemented earlier.