hi please help answer this question asap

Exercise 4 Study the implementation below, which uses an array to implement a Queue. As opposed to the linear queue covered in the lectures, this implementation does not waste space. class Circularqueue def init (self, size): assert size Size nustube positive" self.array[None] size self.reset O def is enpty (self): return self.size0 def isfull (self) return self.sizelen(self, array) def serve(self): assert self.size, "Empty queue" item self-array [self. front ] self, front- (self. front + 1) % len (self, array) self.size1 return item def append (self, itm): assert not self.isfullO, "Full queue self, array [self, rear] item self, re ar (self, rear + 1) % len (self, array) self.size1 Write a Python method, printreverse queue self), for the class CircularQueue, which prints all the items in the queue from rear to front (without changing the queue