Which XXX condition generates the following output? Not found #include <stdio.h> int BinarySearch(int numberList[], int element, int lowVal, int highVal) { int midVal; if (XXX) { midVal = (highVal + lowVal) / 2; if (numberList[midVal] == element) { return midVal; } else if (numberList[midVal] > element) { return BinarySearch(numberList, element, lowVal, midVal - 1); } else { return BinarySearch(numberList, element, midVal + 1, highVal); } } else { return -1; } } int main(void) { int size = 10; int numberList[size]; int element = 20; int matchPos; for (int i = 0; i < size; ++i) { numberList[i] = i; } matchPos = BinarySearch(numberList, element, 0, size - 1); if (matchPos >= 0) { printf("Found at position %d.n", matchPos); } else { printf("Not found.n"); } return 0; } options: lowVal >= highVal lowVal == highVal lowVal <= highVal lowVal + highVal == 0.

1. Which XXX condition generates the following output? Not found
#include <stdio.h> int BinarySearch(int numberList[], int element, int lowVal, int highVal) { int
midVal; if (XXX) { midVal = (highVal + lowVal) / 2; if (numberList[midVal] == element) { return
midVal; } else if (numberList[midVal] > element) { return BinarySearch(numberList, element,
lowVal, midVal - 1); } else { return BinarySearch(numberList, element, midVal + 1, highVal); } }
else { return -1; } } int main(void) { int size = 10; int numberList[size]; int element = 20; int
matchPos; for (int i = 0; i < size; ++i) { numberList[i] = i; } matchPos = BinarySearch(numberList,
element, 0, size - 1); if (matchPos >= 0) { printf("Found at position %d.n", matchPos); } else {
printf("Not found.n"); } return 0; }
options:
lowVal >= highVal
lowVal == highVal
lowVal <= highVal
lowVal + highVal == 0