Question: Write a recursive function that returns all permutations of a given string. — - For example, given “”, y should return [], - For example, given “ho” should return [“ho”, “oh”], - For example, given “hey” should return [“ehy”, “eyh”, “hey”, “hye”, “yeh”, “yhe”]. Hints: - You can treat one character of the given string and call recursively to treat the remaining part, …