you have an array containing the prime numbers from 2 to 311 in sorted order: [2, 3, 5, 7, 11, 13, ..., 307, 311]. there are 64 items in the array. about how many items of the array would binary search have to examine before concluding that 52 is not in the array, and therefore not prime? 11 64 32 7