Computer Science · Data Structures

Consider the following array-based Queue implementation in Python. What is the value of q.front after executing the given operations? class Queue: def init(self, size): self.arr = [None]*size; self.front = -1; self.rear = -1; self.size = size def enqueue(self, val): if self.rear == self.size - 1: return 'Full' if self.front == -1: self.front = 0 self.rear += 1; self.arr[self.rear] = val q = Queue(3); q.enqueue(10); q.enqueue(20); q.enqueue(30)