Given a sorted array of integers, what can be the minimum worst case time complexity to find ceiling of a number $x$ in given array? Ceiling of an element $x$ is the smallest element present in array which is greater than or equal to $x.$ Ceiling is not present if $x$ is greater than the maximum element present in array. For example, if the given array is $\{12,67,90,100,300,399\}$ and $x=95,$ then output should be $100.$

Your answer:

$O(logn**logn)$

O$($Logn$)$

$O(n)$