Which of the following statements are true for an array based binary search? Best case, worst case, and average case are the same complexity. It's like a linear search and starts at the first element of the array. Its Big-Oh is O(n) The array needs to be sorted. Its Big-Oh is O(Ign)