1) Suppose we have an unsorted list of 15 names. How many searches are necessary for it to be worth first sorting the list and then using binary-search for searching rather than just using linear (sequential) search to search it without first sorting? Assume Selection-Sort is used to sort.

a) 0 (Its always worth it)

b) 5 c) 10 d) 15

e) 20

can you show work, explain and give your own example. thank you