1. Suppose you have a circular queue of size 6 (1 to 6). Initially the value of the front and rear is 0. Now show the state of the queue if the following operation is performed on the queue. Also find...

1. Suppose you have a circular queue of size 6 (1 to 6). Initially the value of the
front and rear is 0. Now show the state of the queue if the following operation
is performed on the queue. Also find the value of front and rear in each step.
insert (10); insert (5), delete (), insert (9); insert (9); insert (7); insert (5); insert
(8); insert (10); insert (11).