Give a recursive implementation to the following function:
void removeOdd(int arr[], int& arrSize) This function is given arr, an array of integers, and its logical size, arrSize. When called, it should reorder (in-place) the elements of arr so that it contains only the odd numbers in their original relative order.
Note: Even numbers are not "really" removed from the array. Since arrSize is passed by reference, updating it will reflect the new logical size (without the even numbers).
For example, if arr = [5, 6, 7, 8] and arrSize = 4, calling removeOdd(arr, arrSize) will update arrSize to be 2, and place 5 and 7 in the first two positions of arr.
Note: You don't need to write a main() program. Please use C++.