1. How do you determine if a situation or problem involves permutations? 2. Differentiate between permutation in general (n objects taken r at a time), circular permutation, and distinguishable permutation (when some objects are alike). 3. a. Find the number of permutations of n objects when arranged (n - 1) at a time for any positive integer n. b. Find the number of permutations of n objects when taken all at a time. c. Compare the two (a and b). Explain why the answers still make sense. 4. Going back to the “combination” lock problem on page 285, suppose that the lock contained the 4 digits 1, 4, 7, 9 but you totally forgot the order in which they come. What are you going to do? How can you apply your knowledge of permutations here? Elaborate.