You are given a string s and an integer t, which denotes the number of transformations to perform on s.

In one transformation, each character in s is simultaneously replaced according to these rules:

• If the character is 'z', it is replaced by the string "ab".

• For any other character, it is replaced by the next character in the English alphabet (for instance, 'a' becomes 'b', 'b' becomes 'c', and so forth).

Return the total number of characters in the string after applying t transformations. Since the answer may be very large, return it modulo $10^9 + 7$.

Constraints:

• $1 \leq$ s.length $\leq 10^5$

• s consists only of lowercase English letters.

• $1 \leq$ t $\leq 10^5$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.