pointer-based implementation notes as in stacksa queue could be implemented using linked list queue can be implemented by the following declarations and algorithmsstruct queuenode itemqueuenode *next}struct queuenode*front*rearvoid insert(queuenode *frontqueuenode *reart estruct queuenode *xx new(queuenode) ->item eif(front =nullfront xelse rear->next xrear xvoid delete(queuenode *frontt equeuenode *front/*this procedure deletes the element from the front of the queue stores it in *if(front =nullprintf("queue is empty")else front->itemfront front->nextif(front =nullrear nullboolean empty(queuenode * /check if queue is emptyif( =nullreturn(trueelse return(false)void initialize(queuenode *frontqueuenode *rearfront nullrear nulltask write program to implement circular queue lovely professional university