Recursive leads to a simple$-$to$-$understand solution for generating all the permutations of the letters of a character string. What is the base case for terminating the recursion when generating all permutations of letters?

Question $1$ options:

strings with fewer characters than the original input

strings with zero or one character

duplicate strings

strings with more characters than the original input