Problem
1. Given an n-element array X, Algorithm D calls Algorithm E on each element X[i]. Algorithm E runs in O(i) time when it is called on element X[i]. What is the worst-case running time of Algorithm D?
2. Describe a recursive algorithm to compute the integer part of the base-two logarithm of n using only addition and integer division.