Leetcode 1220. Count Vowels Permutation

Count the number of length-n vowel strings that correspond to walks of length n−1 in a fixed directed graph of 5 states given by the follow-rules, returning the result modulo 10^9+7. This is a 5-state linear recurrence counting walks (solvable with simple DP or matrix exponentiation).