Construct a priority queue using a heapordered binary tree, but instead of an array, use a triply linked structure. Each node will require three links: two to go down the tree and one to traverse up the tree. Even if no maximum priority-queue size is specified ahead of time, your solution should ensure logarithmic running time per operation.

Implement a priority queue using a heapordered binary tree, but use a triply linked structure instead of an array. You will needthree links per node: two to traverse down the tree and one to traverse up the tree. Yourimplementation should guarantee logarithmic running time per operation, even if nomaximum priority-queue size is known ahead of time.

5. Given an efficient circular bent array-based queue q capable of holding 7 objects. Show the final contents of the array after the following code is executed: for (int k = 1; k <= 6; k++) q.enqueue(k); for (int k = 1; k <= 3; k++) { q.dequeue(); q.enqueue(q.dequeue()); } 0 1 2 3 4 5 6

Problem 2. In Project 6 you are required to use pthreads condition variables and mutexes to synchronize accesses to shared variables in your priority queue implementation. Ben Bitdiddle wants to try (on his own) to do it using semaphores instead. As in Project 6, the “next" operation returns the highest-priority item in the queue; if the queue is empty, it blocks until the queue becomes non-empty. The “insert" operation places an item in the queue, and if the queue went from empty to non-empty, it signals any waiting threads. Ben's implementation uses a (global) semaphore to count the number of items in the queue, and uses the Bryant and O'Hallaron "P()" and "V()" wrapper functions (see text) to decrement and increment it. He declares a global sem_t list_size and initializes it with sem_init(&list_size,0,0). The global variable list_head points to the first item in the list and is initially NULL. a. In Ben's first attempt, the pq_next() function does this: P(list_size); // block until…