Question 13:

Consider the following binary search function below:

---

public static int bSearch(int[] arr, int left, int right, int x) {
	if (right >= left) {
		int mid = (left + right) / 2;
		if (arr[mid] == x) {
			return mid;
		}
		else if (arr[mid] > x) {
			return bSearch(arr, left, mid - 1, x);
		}
		else {
			return bSearch(arr, mid + 1, right, x);
		}
	}

	return -1;
}

---

A sorted array of length 7 contains only positive integers. 
The call bSearch(arr, 0, 6, -5) searches for a value that is less than every element. 
How many times is bSearch called total?

A. 3
B. 4
C. 7
D. 8
