With the Binary Search algorithm, the algorithm can be developed by the loop-based form as well as a recursive form. Which ofthe following is not true?O If the item is not found, the loop version returns when the range bounds reach, but the recursive version finishes when the recursive depth ismore than half the initial search range.The search range starts with the whole array, and only the recursive version can work on a subrange passed through arguments.O Both forms of the program divide the search range repeatedly in half.O If the item is found, the loop version returns from the entire method, whereas the recursive version returns from one level of recursion.

With the Binary Search algorithm, the algorithm can be developed by the loop-based form as well as a recursive form. Which of the following is not true? O If the item is not found, the loop version returns when the range bounds reach, but the recursive version finishes when the recursive depth is more than half the initial search range. O The search range starts with the whole array, and only the recursive version can work on a subrange passed through arguments. O Both forms of the program divide the search range repeatedly in half. O If the item is found, the loop version returns from the entire method, whereas the recursive version returns from one level of recursion.

With the Binary Search algorithm, the algorithm can be developed by the loop-based form as well as a recursive form. Which of the following is not true? O If the item is not found, the loop version returns when the range bounds reach, but the recursive version finishes when the recursive depth is more than half the initial search range. O The search range starts with the whole array, and only the recursive version can work on a subrange passed through arguments. O Both forms of the program divide the search range repeatedly in half. O If the item is found, the loop version returns from the entire method, whereas the recursive version returns from one level of recursion.