Q2 - Amazon is developing a new word game where players rearrange letters within words while maintaining the structure of the phrase. The game has an interesting scoring system based on valid arrangements. Game Rules:1. Players receive a phrase where words are separated by single spaces2. Players can shuffle letters within each word, but can't move letters between words 3. Word order must stay the same4. The goal is to find all possible unique arrangements For example, if a player gets the phrase "code jam": - They can create "eocd maj" (valid - letters shuffled within each word) - They cannot create "jam code" (invalid - word order changed) - They cannot create "codj ame" (invalid - letters moved between words) Challenge: You're part of the game development team, and you need to create a function that calculates how many different valid arrangements are possible for a given phrase. Since this number can be very large, return the result modulo 10^9 + 7. Can you help create an algorithm that counts all possible valid arrangements?