TO BE CODED IN C++

Exercise 2 ( 50 points) Write the code algorithm of the function Swap th throueue O n at m) that takes as parameters, a queue Q a positive integer n and a positive integer m. The function swaps thenh and t elements of the queue. The order of the remaining elements remains unchanged. The only operations that you can do on the queue are the following: addQueue0. deleteQueue0. Qsize0.and Front0. You can use any additional number of queues and stacks if needed For example, suppose: Q[5,11,34, 67,43,55,15,10] and n-3 and m -6 (5 is at the front of the Q) After a call to the function SwapNthMth (Q, 3,6), the Q will look like: Q5, 11,55, 67,43, 34,15,10]