Word Transformation

Problem Statement

Word Transformation Problem Description You are given a string word of lowercase English letters. One transformation replaces every character of the current string at the same time: If the character is 'z' , it is replaced by the two-character string "ab" . Otherwise, it is replaced by the next letter of the alphabet ( 'a' becomes 'b' , 'b' becomes 'c' , ..., 'y' becomes 'z' ). For example, the string "azbk" becomes "babcl" after 1 transformation. Given word and an integer t , find the length of the string after exactly t transformations. Since the length can be very large, report it modulo 10 9 + 7 . Function Description Complete the function getTransformedLength . getTransformedLength has the following parameters: string word : the initial string int t : the number of transformations Returns: int : the length of the string after exactly t transformations, modulo 10 9 + 7 Input Format The first line contains the string word . The second line contains the integer t . Output Format Prin