Show that the average time taken to find the required string in a raw list, assuming that the original names were chosen at random, is about S + N binary comparisons. (Note that you don't have to compare the whole string of length N, since a comparison can be terminated as soon as a mismatch occurs; show that you need on average two binary comparisons per incorrect string match) Compare this with the worst-case search time - assuming that the devil chooses the set of strings and the search key.