The ADT randomized queue is like a queue, but the removal and retrieval operations involve an entry chosen at random instead of the entry at the beginning of the queue. These operations should return...

The ADT randomized queue is like a queue, but the removal and retrieval operations involve an entry chosen at random instead of the entry at the beginning of the queue. These operations should return null if they encounter an empty randomized queue.

a. Write a Java interface that specifies the methods for a randomized queue. Name the retrieval operation get instead of get Front.

b. Define a class of randomized queues, named RandomizedQueue, that implements the interface you created in Part a.