Permutation function def permute(s): n = len(s) if n <= 1: return s elif n == 2: return [''.join([s[0],s[1]]),''.join([s[1],s[0]])] else:# n > 2 snew = [] for i in range(n): a = [k for k in s]#copy s to a #print(s) ele = a.pop(i) for p in permute(a): q = ele + p if not(q in snew): snew.append(q) return snew def permutations(string): s = [ele for ele in string] return permute(s) This code ...