What is the worst$-$case time complexity of Binary Search on a sorted list of size nQuestion $9$ options:nn$^2$floor$($log n$)+1$none of the above