3) Recursion Problems a) Write a recursive method double sumSeries (int i) that computes the following sum: 1 2 3 4 5 6 3 5 79 13 2i + 1 DO NOT USE ANY LOOPS b) Write a recursive method String reverse (String text) that reverses a string For example, reverse ("Hellol") returns the string lolleH" Implement a recursive solution by removing the first character, reversing the remaining text, and combining the two. DO NOT USE ANY LOOPS Hint: The method substring (beginIndex) of the Java class string returns th substring starting at beginIndex and ending at the end of the string example, if string str "Chaitanya", then str.substring(4) returns "tanya