To be done in Python:

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) # c# 2 # 1. For instance, the word python has 6! or 720 permutations. 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 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 characters of the word.)

Sample output:

Enter a word: ear ear era aer are rea rae