Given an input string, word, return all possible permutations of the string.

Note: The order of permutations does not matter.

Constraints:

• All characters in word are unique.

• $1 \leq$ word.length $\leq 6$

• All characters in word are lowercase English letters.