A function that uses the binary search algorithm to search for a value in an arraya. repeatedly divides the elements into the number of segments you specify and discards the segments that don’t have the value until the value is found and a pointer to the element is returnedb. repeatedly divides the elements in half and discards the half that doesn't have the value until the value is found and a pointer to the element is returnedc. repeatedly divides the sorted elements in half and discards the half that doesn't have the value until the value is found and the index of the element is returnedd. repeatedly divides the elements into the number of segments you specify and discards the segments that don’t have the value until the value is found and the index of the element is returned