5. A programmer plans to use a sort algorithm known to be O(). the algorithm is OK if it will sort 2,000 records in less than one second on the target machine. The programmer does a simple test, and finds that it takes 10 milliseconds to sort 100 records. Is the algorithm fast enough? The project manager states that A programmer is writing a binary search algorithm for use on an ordered array that will range in size from 1,000,000 to 10,000,000 records. 6. a) What is the number of comparisons done in the worst case? b) What is the number of comparisons done in the best case? 224