Hello I need help editing my C++ code to the instructions I provided below. Please follow the instructions I would appreciate it. Test the arrays with the arrays I've provided. Thanks.  PLEASE ALSO INCLUDE COMMENTS TO SHOW WHERE THE CHANGES WERE MADE.!!

INSTRUCTIONS:

Rewrite the binary search function in Listing 7.6 (copied below), BinarySearch.cpp to use a generic type for array elements. Test the function with an array of int, double, and string values.

 

Listing 7.6 BinarySearch.cpp

#include
using namespace std;

int binarySearch(const int list[], int key, int listSize);

int main()
{
  int list[] = {-3, 1, 2, 4, 9, 23};
  cout << binarySearch(list, 2, 6) << endl;
 
  return 0;
}

int binarySearch(const int list[], int key, int listSize)
{
  int low = 0;
  int high = listSize - 1;

  while (high >= low)
  {
     int mid = (low + high) / 2;
     if (key < list[mid])
        high = mid - 1;
     else if (key == list[mid])
             return mid;
          else
             low = mid + 1;
  }
 
  return -low - 1;
}
 

YOU MAY TEST THE CODE WITH THE FOLLOWING ARRAYS:
 

int intArray[] = {1, 2, 3, 4, 8, 15, 23, 31, 45, 56, 67, 466, 656, 788, 899};
double doubleArray[] = {0.1, 2.5, 3.6, 4.7, 8.8, 15.8, 23.4, 31.5, 45.6, 56.6, 67.5, 466.5, 656.7, 788.9, 899.9};
string cities[] = {"Atlanta", "Augusta", "Burbank", "Glendale". "Macon", "Pasadena", "Savannah", "Sylmar"};