as follows algorithm begin procedure peek return queue[frontend procedure implementation of peek(function in programming language example int peek(return queue[front]isfull(as we are using single dimension array to implement queuewe just check for the rear pointer to reach at maxsize to determine that the queue is full in case we maintain the queue in circular linked-listthe algorithm will differ algorithm of isfull(function algorithm begin procedure isfull if rear equals to maxsize return true else return false endif end procedure implementation of isfull(function in programming language example bool isfull(if(rear =maxsize return trueelse return falseisempty(algorithm of isempty(function algorithm begin procedure isempty if front is less than min or front is greater than rear return true