DATA STRUCTURE AND ALGORITHM DESIGN Question

b. Queue abstract data type defines a collection that keeps objects in a sequence, They are used in a host of different applications, and as a tool for many more sophisticated data structures and algorithms. Queue abstract data type (ADT) such that an instance Q supports two methods: Q.enqueue () and Q.dequeue ():, it also support accessor methods such as Q.len() and isEmpty(). Design a queue and indicate what values are returned during the following series of queue operations, if executed upon an initially empty queue? (7 marks) enqueue (t), enqueue (3), dequeue (), enqueue (2), enqueue (8), dequeue (), dequeue (), enqueue (9), len(), enqueue (1), dequeue (), enqueue (7), enqueue (6), de queue (), isEmpty(), enqueue (f), dequeue (), dequeue (), enqueue (h), enqueue (11), len(), enqueue (69). Suppose an initially empty queue Q has executed a total of 32 enqueue operations, 10 first operations, and 15 dequeue operations, 5 of which raised Empty errors that were caught and ignored. What is the current size of