Problem
1. What are all permutations of the four-letter word beat?
2. Our recursion for the permutation generator stops at the empty string. What simple modification would make the recursion stop at strings of length 0 or 1?
3. Why isn't it easy to develop an iterative solution for the permutation generator?