At the end of Section 3.4.2 (of Invitation to Computer Science, 7th edition), we talked about the trade-off between using sequential search on an unsorted list as opposed to sorting the list and then using binary search. If the list size is n = 100,000, about how many worst-case searches must be done before the second alternative is better in terms of number of comparisons? (Hint: Let p represent the number of searches done and assume selection sort would be used to sort the list before using binary search.)