mnemonics

Trying to solve a number to mnemonics problem using recursion Question: Given a stringified phone number of non-zero length, write a function that returns all mnemonics for this phone number in any order. ` def phoneNumberMnemonics(phoneNumber, Mnemonics=[”], idx=0): number_lookup={‘0’:[‘0’], ‘1’:[‘1’], ‘2’:[‘a’,’b’,’c’], ‘3’:[‘d’,’e’,’f’], ‘4’:[‘g’,’h’,’i’], ‘5’:[‘j’,’k’,’l’], ‘6’:[‘m’,’n’,’o’], ‘7’:[‘p’,’q’,’r’,’s’], ‘8’:[‘t’,’u’,’v’], ‘9’:[‘w’,’x’,’y’,’z’]} if idx==len(phoneNumber): return Mnemonics else: new_Mnemonics=[] for …