Given an array arr = {45,77,89,90,94,99,100} and key = 100; What are the mid values(corresponding array elements) generated in the first and second iterations?Options90 and 9989 and 9494 and 9990 and 100

The question seems to be about the Binary Search algorithm. In Binary Search, we start with the middle element of the array. If the key is equal to the middle element, we have found the element. If the key is less than the middle element, we repeat the process with the left half of the array. If the key is greater than the middle element, we repeat the process with the right half of the array.

Here is the step by step process for the given array and key:

1. The given array is arr = {45,77,89,90,94,99,100} and the key is 100.
2. The middle element of the array in the first iteration is 90 (the fourth element).
3. Since 100 (the key) is greater than 90, we discard the left half of the array and repeat the process with the right half of the array {94,99,100}.
4. The middle element of the array in the second iteration is 99 (the second element of the new array).
5. Since 100 (the key) is greater than 99, we discard the left half of the array and repeat the process with the right half of the array {100}.

So, the mid values (corresponding array elements) generated in the first and second iterations are 90 and 99. Therefore, the correct option is "90 and 99".