This questions covers python, please use 3.5 or later. Also please use recursion if possible.

5. Permutations A reordering of the letters of a word is called a permutation of the word. A word of n different characters has n! permutations where n!- n. (n 1)- (n - 2). -2-1. For instance, the word tpython has 6! or 720 permuta- tions. Some of its permutations are pythno, ypntoh, tonyhp, and ontphy. Write a program that requests a word without repeated characters as input and then displays all the Chapter 6 Miscellancous Topics FIGURE 6.31 Outcome of Programming Project 4. permutations of the word. See Fig. 6.32. (Hint: Suppose the word has six characters. Consider the characters of the word one at a time. Then display the words beginning with that character and followed by each of the 5! permutations of the remaining char acters of the word.) Enter a word: ear ear era aer are rea rae FIGURE 6.32 Possible outcome of Programming Project 5