Count Number of Texts

Alice is texting Bob using her phone. The mapping of digits to letters is the standard phone keypad mapping:

• 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'

In order to add a letter, Alice has to press the key of the corresponding digit i times, where i is the position of the letter in the key.

• For example, to add the letter 's', Alice has to press '7' four times.
• Similarly, to add the letter 'k', Alice has to press '5' twice.
• The digits '0' and '1' do not map to any letters, so Alice does not use them.

However, due to an error in transmission, Bob did not receive Alice's text message but received a string of pressed keys instead.

Given a string pressedKeys representing the string received by Bob, return the total number of possible text messages Alice could have sent.

Since the answer may be very large, return it modulo 10^9 + 7.