Answer & Explanation:DescriptionYou are tasked with implementing three different queues:Dynamic Array FIFO QueueDoubly Linked List FIFO QueuePriority QueueYou are also to write a driver program called AssignmentQueueDriver.java.Driver ProgramThe driver should start by prompting the user for the type of queue he or she would like:What type of queue would you like:Array FIFO QueueLinked List FIFO QueuePriority QueueNext, the program should loop on the following prompt:What would you like to do:Add item to queueDequeueQuitIf the user selects option 1, then prompt the user for the name of the new assignment, followed by the value and days until due. If the second option is selected, then dequeue from the queue and print out the object (use the toString provided).Test CasesAs with all our projects, you are expected to generate your own test cases. Consider dequeing from an empty queue. What if an assignment has 0 days until due?Write UpRun time Analysis: Use Big-Oh notation to give the runtime complexity of each sorting method you implemented
assignment.txt
