Data Structures..

(a) (20 points) Define the method inDogish recursively such that it returns true if the word is in dog-ish and false if it is not. I left a dogish Helper method, which I guarantee you will need to recursively solve dogish. An iterative solution will receive no points. (b) (20 points) Define the method inXish that does the same logic of dog-ish but for some word X. The method returns true if the word contains all the letters in the word X. The solution must be recursive. An iterative solution will receive no points. Home | Chegg.com replit share your program enhance your work after submitting O export to back to classroom run 1. Flass Main { public static void main(String[] args) { A leave this main method blank but feel free to uncomment below lines to test your code */ // System.out.println(dogish("aplderogad")); 1/ System.out.println(dogishGeneralized("aplderogad", "dog")); NAS8696UBURBEVOUT AWN // returns true if the word is in dog-ish 17 returns false if word is not in dog-ish public static boolean inDogish(String word) { return false; 1/ necessary to implement inDogish recursively public static boolean dogi shHelper(String word, char letter) { return false; 11 a generalized version of the inDogish method public static boolean inXish(String word, String x){ return false; java version "1.8.0_31" Java(TM) SE Runtime Environment (build 1.8.0_31-613) Java HotSpot (TM) 64-Bit Server VM (build 25.31-b@7, mixed mode)