We are given following array: 12, 17, 23, 29, 31, 39, 44, 52, 63. If we wanted to find 63 using a binary search, which integers will we visit until we find 63? A. Since the array is sorted and 63 is at the end of the array, a binary search finds it in one step without visiting any other numbers before 63. B. It starts from the beginning and compares if the current element is equal to 63. So, it visits 12, 17, 23 and all other elements until it finds 63 at last. C. A binary search visits every second element, skipping one until it finds the value, i.e. first it visits odd-indexed numbers and then even-indexed numbers. So, it visits 12, 23, 31, 44 and finds 63. There is no need to visit even-indexed numbers since it has already found it. In that way, the time to find the value will be 2 times less. D. It visits the middle of the array first, which is 31. Since 63 is greater than 31, it visits the middle of the right side, which is 44. Since 63 is greater than 44, it visits the middle of the right side, which is 52. Since 63 is greater than 52, it visits the middle of the right side which is 63 and finds it