Write recursive functions that solve each of the following problems. Your functions must be recursive -- that is, they should have a base case and, in each recursive call, your problem should be reduced to an identical problem of a smaller size. You should have no loops in your code. Your solutions should not be using built-in functions with the exception of len():

Write a recursive function that removes the vowels (a,e,i,o,u) from a string containing all lower case letters. Your function should return a new string with the vowels removed. If the list is empty, the resulting string should be empty. You may not use any built-in-functions for this question except for "in" and "len". Call this function "remVowels".