Note that this is a circular list.

Consider a pointer-based implementation for ADT queue (similar to the one from lecture) that uses a circular list, but no front pointer. (You can get to the front by going to the element after the back, unless the list is empty.) Write the enqueue member operation. The prototype (following the queue class from lecture) is: template bool Queue::enqueue(Queueltem newltem)