Write permutations(s) returning all orderings of the characters of a string with unique characters, sorted alphabetically. Use recursion (no itertools).
permutations('abc')
→ ['abc', 'acb', 'bac', 'bca', 'cab', 'cba']permutations('a')
→ ['a']Submit runs 5 tests, including hidden edge cases.
Each hint gives a little more help. Try on your own first.
Run your code to see the output here.