Problem
1. Explain three scenario of queue operation in a real world scenario. Your explanation must include the concept of insertion and deletion.
2. Write the body for a function that replaces each copy of an item in a queue with another item by using the following specification. Function header: Replaceltem (OueType queue. int oldltem. int newltem) Function: Replaces all occurrence of old Item with newltem. Precondition: Queue have been initialized.
Postcondition: each occurrence of oldltem in queue has been replaced with newltem.
3. A simple array based implementation of the queue suffers from false overflow. Discuss with example the false overflow issue and solution.