Find a lower bound on how many searches s we would have to perform on an unsorted array of size n, where n; s 2 N (n and s are natural numbers), for it to asymptotically cost less overall to sort the array and then perform binary searches. Use the following expressions: c0 n c1 for linear search, c2 n log n c3 for merge sort, and c4 log n c5 for binary search, where ci's are constants. Make sure to indicate which constants were combined. This will not be a speci c number, it will be an inequality in terms of the number of searches s, size of the array n, and constants ci.

answer(a) occurs after your prediction;

a  social news website  is an  internet  website  that features  user-posted stories. such stories are ranked based on popularity, as voted on by other users of the site or by website administrators. users typically comment online on the news posts and these comments may also be ranked in popularity. since their emergence with the birth of  web 2.0, social news sites have been used to link many types of information, including news, humor, support, and discussion. all such websites allow the users to submit content and each site differs in how the content is moderated. on the  slashdot  and  fark  websites,  administrators  decide which articles are selected for the front page. on  reddit  and  digg, the articles that get the most votes from the community of users will make it to the front page. many social news websites also feature an online comment system, where users discuss the issues raised in an article. some of these sites have also applied their voting system to the comments, so that the most popular comments are displayed first. some social news websites also have a  social networking  function, in that users can set up a user profile and follow other users' online activity on the website.