For Case 1: (substring Operations using recursion)

In this task, you are required to write a recursion that gets a string and two characters and returns the substring that is enclosed in two given characters. You can assume that the given string includes only one instance of each enclosing characters.

For example, where the input string is This is [quite} an example! and the first enclosing character is '[' and the second is '}', it should return quite. The name of the method is getSubstring()

public static String getSubstring(String str, char open, char close)

{

return "";

}

please do it with recurison