Given a telephone keypad, write a program that generates all possible permutations of letter strings.
Implement the function using the standard mapping from digits 2 through 9 to telephone keypad letters. Return combinations in keypad order, and return an empty list when the input is empty.
Input: a string digits. Output: a list of strings, with one character selected for each input digit.
def letter_combinations(digits):