The user created the following array:int $[1$ numbers $=\{12,23,25,38,8,62,6,46)1.$ He applied a binary search algorithm to determine the index for $\text{'}23.$The following result is returned:Element $23$ found at index $12.$ Using the same code, he then requested to determine the index for $\text{'}8\text{'}.$The following result is returned:Element not found in the arrayHe is not sure why, in the second instance, $\text{'}8\text{'}$ was not found. You explained to him that the reason is because $...$ a$.$ The element is not found, because the target element is not in the array. b$.$ The time complexity is O$($log n$),$ which will result in the compiler going into an end$-$less loop if the element is not found. c$.$ To apply binary search on an array, the array must first be sorted. d$.$ None of the options provided, is correct.