Problem 3: Almost a priority queue. Design a data structure that supports the following operations for almost a priority queue: (i) FindSecondSmallest() which returns the second smallest item in the data structure. (ii) Insert(x) which inserts item x to the data structure. (iii) DeleteSecondSmallest() which removes the second smallest item from the data structure. Your data structure should implement the operation FindSecondSmallest() in O(1), and the other two operations in O(log n), where n is the number of elements in the data structure.

In C++ language. Please look at the instructions and help with program. This is for intermediate not advanced. so help me understand please

The specifications for the Sorted List ADT state that the item to bedeleted is in the list.1. Rewrite the specification for DeleteItem so that the listis unchanged if the item to be deleted is not in the list.2. Implement DeleteItem as specified in (a) using anarray-based implementation.3. Implement DeleteItem as specified in (a) using alinked implementation.4. Rewrite the specification for DeleteItem so that allcopies of the item to be deleted are removed if they exist.5. Implement DeleteItem as specified in (d) using anarray-based implementation.6. Implement DeleteItem as specified in (d) using alinked implementation.

With the concepts of Queue Data Structure, write the functions performing the following tasks: 1. Insertion of an element in the Queue i.e. enqueue() 2. Deletion of an Element from the Queue i.e. dequeue() 3. Display All Elements in the Queue i.e. dispqueue() 4. Display the Element at the Front i.e. dispfront() 5. enqueue() the Queue with the elements in ascending order. After that, use the above four functions to display the same elements in the Queue in descending order.