9) Write an independent function ( a client function, not a member function) that swaps adjacent elements in a given queue, see the example:

Note: if the queue contains an odd numbers of elements, keep the last element (at the rear) in its location

in c++

9) Write an Independent function (a client function, not a member function) that swaps adjacent elements in a give queue, see the example: Note: if the queue contains an odd number of elements, the last element (at the rear) in its location Before: After