Done in C language using mobaxterm if you can but use basicC
This program is broken up into three different functions ofinsert, delete, and main. This program implements a queue ofindividual characters in a circular list using only a singlepointer to the circular list; separate pointers to the front andrear elements of the queue are not used.
- The linked list must be circular.Ă‚Â Ă‚Â
Ă‚Â Ă‚Â - The insert and remove operations must both be O(1)
Ă‚Â Ă‚Â - You may use only one pointer into the queuefrom the outside; you may not have separate, namedpointers for the front and the rear.
Test Cases:
- Try to remove – thus making sure that the queue was initializedproperly (i.e., empty)
- Insert 'A', then do a remove, then another remove – thus makingsure that you can empty the queue
- Insert 'B', then 'F', do a remove, then insert 'D', then 'C',then do four removes (the last one should fail, of course). Thistest case will make sure your queue is FIFO – your last fourremoves should come out 'F', 'D', 'C', and then \"cannot remove froman empty queue\"
