Given a string containing digits from 2-9 inclusive, return all possible letter combinations that the number could represent

A mapping of digits to letters  is as following:

one string with digits 2-9 inclusive, the length of string is less than 6.

output the letter combinations as described in the problem in ascending order. All letters are in upper case.