Mark all statements that are true for binary search on an array of size n $($n$>10)$

Group of answer choices

It visits all n node by the end of the algorithm $($worst case$)$

It may only visit one node in some cases

It visits all n$/2$ nodes by the end of the algorithm $($worst case$)$

Always finds the element if it exists in the array

Can sometimes be incorrect, and may not find the element even if it exists in the array

In best case, it is O$($logn$)$

In the worst case, it is O$($logn$)$