Question $4$

Consider an array of size $n.n>1.$ To access the element at location $\frac{n}{2},$ the number of operations required is

$O(1)$

$O(n)$

$O(logn)$

$O(\frac{8}{2})$