4. Applications of Reccurence Relations (4 points) (1) (1 point) Count the number of ways to order the elements (i.e. per (2) (1.5 points) Find a recurrence relation for the number of permutations of (3) (1.5 points) Use this recurrence relation to find the number of permuta ., permu tations) of the set a, b, c) a set with n elements tions of a set with n elements using the expansion method (we used this in class to generate a guess for the number of moves in the Towers of Hanoi problem)