Suppose an initially empty queue Q has performed a total of 32 enqueue operations, 10 first operations, and 15 dequeue operations, 5 of which returned null to indicate an empty queue. What is the current size of Q?

12. Find By Value Runtimes What is the worst case runtime for a "find by value" operation for linked lists and for balanced binary search trees? Pick ONE option Linked List: 0(n^2); Balanced BST: O(1) Linked List: 0(n); Balanced BST: O(log(n)) Linked List: O(n^2) ; Balanced BST: O(log(n)) Linked List: 0(n) ; Balanced BST: O(n)

def has_at_least(queue: Queue, n: int) -> bool:"""Return true iff queue contains at least n items. Precondition: n >= 0 >>> queue = Queue()>>> queue.enqueue(1)>>> queue.enqueue(2)>>> queue.enqueue(3)>>> has_at_least(queue, 3)True"""

Suppose the rule of the party is that the participants who arrive later will leave earlier. Which data structure is appropriate to store the participants? Stack Queue ArrayList Linked List