Complete the whole code in C++

CSE225L - Data Structures and Algorithms Lab Expected Output Queue is empty Lab14 (Priority Queue) Operation to Be Tested and Description of Action Input Values Create the priority Queue Structure Print if the queue is empty or not Insert ten items, in the order they appear 4 92 73 11 17 0 51 Print if the queue is empty or not Dequeue one element and print the dequeued value Dequeue one element and print the dequeued value Queue is not empty 17 11 Now, Create a function that will remove a value ba on the index number. Function definition - int Remove (int i) Input: 3 Output: 30 Now Print the whole list of the Priority Queue Then, create a function that will change the value of any index based on user input in the Priority Queue. Also you can say that you are changing the priority of that index. Function definition - void Change Priority (int i, int p) Input : i = 3, p = 33 Now Print the whole list of the Priority Queue