c++

Write the following function recursively. Note, a non-recursive solution to the following problem will result in a grade of O, even if it is correct. bool noAdjPair(const int* array, int size); This function is passed an array of integers and the size of the array. The function returns true if there are no two values in the array that are the same and are adjacent (next to each other), false otherwise. {1,2,3,1,2,3,1,2,3} returns true (nothing beside each other is the same) {1,2,3,1,2,3,1,1,3} returns false (ones are the same) {1,1,2,2,3,3,3} returns false (multiple pairs are the same and beside each other