Phone numbers and PIN codes can be easier to remember when you find words that spell out the number on a standard phone keypad. For example, instead of remembering the combination 2633, you can just think of CODE. Write a recursive function that, given a number, yields all possible spellings (which may or may not be real words).

Explanation:

The following is written in Python and the code first creates a simulated keypad with all the characters. Then the function detects the number passed as an input argument and outputs all the possible spelling combinations.

keypad = {

   '2': 'abc',

   '3': 'def',

   '4': 'ghi',

   '5': 'jkl',

   '6': 'mno',

   '7': 'pqrs',

   '8': 'tuv',

   '9': 'wxyz',

}

def word_numbers(number):

 number = str(number)

 wordList = ['']

 for char in number:

   letters = keypad.get(char, '')

   wordList = [prefix+letter for prefix in wordList for letter in letters]

 return wordList

omg taking this same test i was stuck on the same question i was too lazy to read the book sadly i cant really give you an answer to this question too complex the answer will be in chapter 5 of the cay

they really not common the os x is just a better version of the os like in iphone theirs xr and their xs