$(10$ points$)$ In class we talked about the trade$-$off between using linear$/$sequential search on an unsorted list as opposed to sorting the list and then using binary search. If the list is n $=100000,$ about how many worst$-$case searches must be done before the second alternative is better in terms of the number of comparisons. Assume that we're using selection sort to perform our sorting operation. $($Hint: Let p represent the number of searches done.$)$