int QUEUE_IS_EMPTY; int QUEUE_IS_FULL; void generator(){ Object thing = generate(); pthread_mutex_lock(&qlock); if (QUEUE_IS_FULL){ pthread_cond_wait(&queue_not_full); } enqueue(thing); pthread_cond_signal(&queue_not_full); pthread_mutex_unlock(&qlock); } void consumer(){ pthread_mutex_lock(&qlock); Object thing = dequeue(); consume(thing); while (QUEUE_IS_EMPTY){ pthread_cond_wait(&queue_not_empty); } pthread_cond_signal(&queue_not_full); pthread_mutex_unlock(&qlock); } This code generates objects in generator(), and consumes them in consumer(). Objects are placed into a queue to be consumed, and this queue has a limited size. enqueue() adds an item to the queue, and dequeue() removes one. An item may not be enqueued if the queue is full, or dequeued if the queue is empty. You may assume that QUEUE_IS_EMPTY and QUEUE_IS_FULL always correctly indicate whether the queue is empty, full, or neither, even if they are not updated in these methods. There are three multithreading related errors in this code that could result in deadlocking or other undesirable behavior. What are they?

Note : addqueue works like Enqueue and deleteQueue works like Dequeue Consider the following statements: (8, 9) queueType queue; int num; Show what is output by the following segment of code num = 7; queue.addQueue (6); queue.addQueue (num); num = queue.front (); queue.deleteQueue(); queue.addQueue (num + 5); queue.addQueue (14); queue.addQueue (num queue.addQueue (25); queue.deleteQueue (); 2); cout <« "Queue elements: "; while (!queue.isEmptyQueue ()) { cout <« queue.front () << " "; queue.deleteQueue(); } cout <« endl; Queue elements: 14 14 4 25 Queue elements: 11 14 4 4 Queue elements: 11 14 4 25 Queue elements: 11 14 25 25

BankCustomerQueueADT Implement in C++ a BankCustomer QueueADT that does the following: 1. gets the input about a customer (first name, last name, Bank Account Number, Money to be withdrawn/deposited, etc.) from the user (from the keyboard) 2. inserts (enqueues) the Customer as a record into the BankCustomerQueueADT (your Queue ADT must be able to have a maximum of 20 customer records) 3. removes (dequeues) the Customer record from the BankCustomerQueueADT 4. your BankCustomerQueueADT must also have the behavior of retrieving and displaying the Queue info on the screen after each event (either entry of a Bank Customer into the queue, OR leaving of the Bank customer from the queue). NOTE: Please make sure you debug, run, test and see the program working correctly before submitting. Make sure all the code statements are commented. Make sure your program is indented properly.

python help. Write a LikedQueue (code at bottom) Test it by: Add numbers from 13 to 23 in the queue.  Print the length of the queue Check if the queue is empty Show the item at the front of the queue Remove the first item in the queue Add 100 to the queue Remove all items in the queue Check if the queue is empty """File: linkedqueue.pyAuthor: Ken Lambert"""from node import Nodefrom abstractcollection import AbstractCollectionclass LinkedQueue(AbstractCollection):"""A link-based queue implementation."""# Constructordef __init__(self, sourceCollection = None):"""Sets the initial state of self, which includes thecontents of sourceCollection, if it's present."""self.front = self.rear = NoneAbstractCollection.__init__(self, sourceCollection)# Accessor methodsdef __iter__(self):"""Supports iteration over a view of self."""passdef peek(self):"""Returns the item at the front of the queue.Precondition: the queue is not empty.Raises: KeyError if the stack is empty."""if self.isEmpty():raise…