Create a JAVA program to implement all the queue operations using either array or linked list. The rubric below will be used to assess your output. Enqueue Dequeue Peek Traverse

14. If a queue is implemented under an ArrayList, how much time does a queue remove an item ? а. О(1) b. O(n) c. 0(n2) d. 0(log n)

You will create two programs. The first one will use the data structure Stack and the other program will use the data structure Queue. Keep in mind that you should already know from your video and free textbook that Java uses a LinkedList integration for Queue. Stack Program Create a deck of cards using an array (Array size 15). Each card is an object. So you will have to create a Card class that has a value (1 - 10, Jack, Queen, King, Ace) and suit (clubs, diamonds, heart, spade). You will create a stack and randomly pick a card from the deck to put be pushed onto the stack. You will repeat this 5 times. Then you will take cards off the top of the stack (pop) and reveal the values of the cards in the output. As a challenge, you may have the user guess the value and suit of the card at the bottom of the stack. Queue Program There is a new concert coming to town. This concert is popular and has a long line. The line uses the data structure Queue. The people in the line are objects…

15. If a queue is implemented under an ArrayList, how much time does a queue add an item? a. 0(1) b. O(n) с. О(n2) d. 0(log n)

We can declare a new array and copy the items of the old queue to new and by this, it will extend the size of the queue.