0. Write the following array functions. You can assume that these are integer arrays. Your implementation should not use [ ] operators. Instead use pointers to access array elements.

   Suppose, arr[] = {1, 4, 6, 5, 2, 7, 10}

   1. Search for a given value in the array and return the index of the location. Return -1 if not found in the array.

      void search(int arr[], int n, int val); Using the above array arr, search(arr, 7, 6) should return 2, and search(arr, 7, 8) should return -1.

   2. Reverse the contents of the array.

      void reverse(int arr[], int n);

      Using the above array arr, reverse(arr, 7) should return result in arr contents rearranged as follows: arr = {10, 7, 2, 5, 6, 4, 1}

c. Rearrange the array such that all the odd elements in the array are in the beginning of the array.

void oddFirst(int arr[], int n); Using the above array arr, oddFirst(arr, 7) should return result in arr contents rearranged as follows: arr = {1, 5, 7, 4, 6, 2, 10}

Language is in C++. In particular, the program should use pointer syntax for arrays and not use the bracket notation.