Graph the equations T(n) = log2 n and T(n) = n/ loge n. Which gives the better performance, binary search on a sorted list, or sequential search on a list ordered by frequency where the frequency conforms to a Zipf distribution? Characterize the difference in running times. Help me about this one.