PYTHON PROGRAMMING

Hills. A string s with lowercase alphabetic letters is called a hill if either: it has length 3 such that s[0] s[2] s[0] s[-1] and s [1:-1] isahill DO NOT USE ANY KINDS OF LOOPS, USE ONLY RECURSION For example, "apxgb" is a hill but "apxzb" is not. Note that this definition requires a hill to have odd length of at least 3. Essentially a hill will have an equal number of consecutive alphabetic increases as decreases (with the increases coming first from left to right). Given a string s, and 0 ["aba","aca","aba"] find hills ("abba") C] find hills ("abcde" [] find hills ("delicious") -> ["delic","ous "] find hills ("ab") >C