Combining sorted queues (2.2.14). Make a static function that takes two sorted queues as input and returns a new queue that was created by combining the two queues into a single sorted queue. 2.2.15 mergesort starting at the end of the line. Use the next technique to create a bottom-up mergesort: Given N items, make N queues, each containing one of the objects. From the N queues, create a queue. Re-insert the combined queue after performing Exercise 2.2.14's merging operation on the first two queues. Repeat this process until there is only one queue remaining.

This program will use an array implementation of a linked list to keep an ascending sorted list of numbers. The input data consists of two fields: a single character and an integer value. The single character gets interpreted as one of the following: A - represents a value that is to be added to the linked listD - represents a value to be deleted from the linked listP - indicates that all values are to be printed in ascending order The character is only used to determine which process is to be executed; it should not be printed, entered into the linked list, or processed in any way. The main program should be mainly function calls. Process input data until end of file. All output should be sent to an output file and be appropriately formatted and labeled. Keep a running log of everything that is going on in the processing. Input file: A 54A -17A 32 A 81 A -30 A 18 P A 41 A 93 A 65 A 80 A 104 A -20 D 81 D 54 D -30 A 79 A 63 A 77 A –33 D 104 D -20 D 80 D 32 P

2.2.14 Sorted queues being combined. Create a static function that receives two queues of sorted items as inputs and returns a queue formed by combining the two queues into a single sorted order queue. 2.2.15 Bottom-up mergesort of a queue. Create an implementation of the bottom-up mergesort using the following strategy: Make N queues, each holding one of the N things, given N items. assemble the N queues into a queue. Apply Exercise 2.2.14's merging process to the first two queues several times, and at the conclusion, reinsert the combined queue.Continue until there is just one queue left in the queue of queues.