Given a list of lowercase/uppercase words, return a new list where in each word every vowel is replaced by the next vowel in the sequence a -> e -> i -> o -> u -> a (cyclic). The replacement must preserve the original letter's case (e.g., 'A' -> 'E', 'u' -> 'a'). Consonants and non-letter characters remain unchanged. Examples: - 'apple' -> 'eppli' (a->e, first p unchanged, p unchanged, l unchanged, e->i) - 'Sky' -> 'Sky' (no vowels) Write a function solve(words: list[str]) -> list[str] that performs this transformation on each string in the input list and returns the list of transformed strings in the same order.
(['apple', 'Banana', 'sky', 'IT', 'queue'])['eppli', 'Benene', 'sky', 'OT', 'qiaaa']