Estimate the running time of your algorithm as a function of n and m. Explain your reasoning in detail. How does the efficiency of your algorithm compare to that of the obvious recursive algorithm based on your answer to problem 1 ?
