Please Provide The Code And The Trace Of Calling reverseString("abc") drawn picutre preferably !!

R01: Reverse a string Write a recursive method that accepts a string and returns a version that is reversed. You may assume the input is never null. Example Input Expected Output Hello world. .dlrow olleH This is a string gnirts a si sihT abcdcba abcdcba First, the simplest version of this problem is a string that is either empty or has 1 character. This will become our base case. If string has a length of 1 or less return the string. Now, for the reconstructing of the string. We want to reduce the problem toward the base case. That is we take a character out of the string for each successive call. For instance, lets look at the string abc reverseString - abc reverseString - bc reverseString - c Here, weve removed the first character for each successive call of reverseString and reduced the string down to 1 character. Now we need to build back up to get a reversed string. This will largely depend on

where we make the recursive call. Suppose we do string.charAt(0) + reverseString(restOfString). This will not work because we are taking the first character of the string and concatenating it to the rest of the string. What we want is to take the rest of the reversed string and concatenate it to the first character of the string. So, rephrasing the problem as a recursive solution we say the following: Take the reversed string and concatenate first character to the end of it. This gives us the rest of our pseudocode. String reverseString(string) { if(string has length less than or equal to 1) { return string; } reversed = reverseString(rest of string) + first character of string return reversed; } Provide a trace of calling reverseString(abc) below.