Consider the problem to search a list of n elements for a key. Use the decision tree method to prove that, regardless if the input list is sorted or not, this search problem has time complexity lower bound (log n to the base 2).