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...

In C++

Extracted text: 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. Write a C++ header file that specifies the methods for a randomized queue. Name the retrieval operation get instead of peekFront. b. Define a class of randomized queues, named RandomizedQueue, that implements the header file you created in Part a.