Given the following code for a binary search, how many total times will this method have to be executed in order to find the number 5? int[] arr = {1, 3, 5, 6, 7, 9, 11, 15, 18} return binarySearch(arr, 0, 8, 5)//This counts as call number 1 //method int binarySearch(int arr[], int left, int right, int num) { if (right >= left) { int middle = left + (right - left) / 2; if (arr[middle] == num) return middle; if (arr[mid] > num) return binarySearch(arr, left, middle - 1, num); return binarySearch(arr, middle + 1, right, num); } return -1; }