What is the Big O notation of a binary search algorithm applied to a sorted array?Question 12Answera.Ob.O(log n)c.O(n log n)d.O(n^2)

What is the time complexity of binary search in a sorted array?O(n)O(log n)O(n log n)O(n^2)

What is the time complexity (worst case) of a binary search in an array of size n?O(n^2)O(log(n))O(1)O(n!)

What is the time complexity of searching for an element in an unsorted array of size n?O(n)O(1)O(log(n))O(nlog(n))O(2^n)O(n!)O(n^2)

What is the time complexity of a linear search in an unsorted array?*1 pointA. O(1)B. O(log n)C. O(n)D. O(n^2)

What is the time complexity of accessing the nth element on an unsorted array?O(n!)O(2^n)O(1)O(n)O(nlog(n))O(n^2)O(log(n))