Show how to implement a first-in, first-out (FIFO) queue with a priority queue. Provide pseudocode for the two common queue operations: enqueue and dequeue, with error checking (i.e., how to handle the cases where the queue is empty or full.) There should be a limit on the number of elements the queue can contain and the queue should allow new elements be enqueued as long as it is not full. Also, you should use as few additional bits as possible on each element in the queue to implement the FIFO mechanism. Analyze the running time of your code and explain why.