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 number of elements, keep the last element( at the rear) in its location

Use c++

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