Problem
1. Use recursion to write a Java method for determining if a string s has more vowels than consonants.
2. Suppose you are given two circularly linked lists, L and M, that is, two lists of nodes such that each node has a nonnull next node. Describe a fast algorithm for telling if L and M are really the same list of nodes, but with different (cursor) starting points.