Given a non-empty string consisting only of lowercase letters, return true if the letters are in alphabetical order, and false otherwise. Write a recursive solution (no loops). NOTE: characters can be compared with <. For example: 'a' < 'b' is true, and 'b' < 'a' is false.