In your own words explain the two rules that a proper

Question

1. Place these algorithm classes in order from fastest to slowest: n log n, n, n² , log n, 2ⁿ

2. In your own words, explain the two rules that a proper recursive definition or function must follow.

3. What is the exact result of anagram("foo")?

4. Trace recPower(3,6) and figure out exactly how many multiplications it performs.

5. Why are divide-and-conquer algorithms often very efficient?