Change the recursive definition of equals so that vowels are ignored. Now "kangaroo" equals "kongeroo", both of them equals "kaangaro", and also equal "kngr". The easy way to program this would be to first strip out all vowels and then compare what is left. But for this exercise, try to write a recursive definition that does the comparison on the unaltered strings. This may be somewhat difficult. Translate your definition into Java and test it. Click here to go back to the main menu. Change the recursive definition of equals so that vowels are ignored. Now "kangaroo" equals "kongeroo", both of them equals "kaangaro", and also equal "kngr". The easy way to program this would be to first strip out all vowels and then compare what is left. But for this exercise, try to write a recursive definition that does the comparison on the unaltered strings. This may be somewhat difficult. Translate your definition into Java and test it. Click here to go back to the main menu