Problem
1.Suppose that instead of having the node+search function f(d) = 1 in an order-d B-tree T, we have f(d) = logd. What does the asymptotic running time of performing a search in T now become?
2. Describe an external-memory algorithm that determines (using O(n/B) transfers) whether a list of n integers contains a value occurring more than n/2 times.