Need some help on this C++ problem

5.12 Exercise: Swap pairs of Elements in an Array Write a recursive function to overwrite an array A of n integers so that the first and second element are swapped, the third and the fourth, and so on. The swapping in pairs happens from left to right. Assume that n > 0. Use the function prototype void swapPairs Left ToRight(int A[], int n); You may overload the function but the overloaded function must be called from inside swapPairsLeft ToRight with the prototype given above. Examples if the array A has the values 11 22 33 44 55 66 and n = 6 then after the call to swapPairsLeft ToRight, A has the values 22 11 44 33 66 55 if the array A has the values 11 22 33 44 55 and n = 5 then after the call to swapPairsLeft ToRight, A has the values 22 11 44 33 55