Write a fully-functioning priority java program to implement Dequeue with array(do not use heap). add "push()" and "pop()" functions to allow the queue to work as a stack. write methods: addfront, delfront(right to left), addrear , delrear(right to left), and display. With your queue, you should have a fixed-length backing array. Do no use ArrayLists or anything else that gives you a dynamic backing array. You should start with a backing array of size 5 , and double it whenever you go beyond the end of the backing array. (Note: when you do increase the size of the backing array, you should print out a message on the screen so that the marker can see that you did increase the size of the backing array.)