Choose The Appropriate Code That Does Binary Search Using #466

 public static int recursive(int arr[], int low, int high, int key) { int mid = low + (high - low)/2; if(arr[mid] == key) { return mid; } else if(arr[mid] < key) { return recursive(arr,mid+1,high,key); } else { return recursive(arr,low,mid-1,key); } }

 public static int recursive(int arr[], int low, int high, int key) { int mid = low + (high + low)/2; if(arr[mid] == key) { return mid; } else if(arr[mid] < key) { return recursive(arr,mid-1,high,key); } else { return recursive(arr,low,mid+1,key); } }

 public static int recursive(int arr[], int low, int high, int key) { int mid = low + (high - low)/2; if(arr[mid] == key) { return mid; } else if(arr[mid] < key) { return recursive(arr,mid,high,key); } else { return recursive(arr,low,mid-1,key); } }

 public static int recursive(int arr[], int low, int high, int key) { int mid = low + ((high - low)/2)+1; if(arr[mid] == key) { return mid; } else if(arr[mid] < key) { return recursive(arr,mid,high,key); } else { return recursive(arr,low,mid-1,key); } }