Consider a sorted array of integers, we have to implement the function Max( ) with input ‘x’, which find the maximum element present in array which is smaller than or equal to ‘x’. If “x” is smallest element then Max( ) will return “0”. What is the time complexity taken by Max( )?
