E13.12 Implement a SubstringGenerator (class) that generates all substrings of a string recursively. For example, the substrings of the string rum are the seven strings

rum, ru, r, um, u, m,

Hint: First enumerate all substrings that start with the first character. There are n of them if the string has length n. Then enumerate the substrings of the string that you obtain by removing the first character.

Here is what your output should look like after your project is completed. (The order of your substrings is not important, if your generator produces all substrings correctly).

Substrings of "ab"

Actual: '' 'b' 'a' 'ab'

Expected: '' 'b' 'a' 'ab'

Substrings of "abc"

Actual: '' 'c' 'b' 'bc' 'a' 'ab' 'abc'

Expected: '' 'c' 'b' 'bc' 'a' 'ab' 'abc'

Substrings of "abc123"

Actual: '' '3' '2' '23' '1' '12' '123' 'c' 'c1' 'c12' 'c123' 'b' 'bc' 'bc1' 'bc12' 'bc123' 'a' 'ab' 'abc' 'abc1' 'abc12' 'abc123'

Expected: '' '3' '2' '23' '1' '12' '123' 'c' 'c1' 'c12' 'c123' 'b' 'bc' 'bc1' 'bc12' 'bc123' 'a' 'ab' 'abc' 'abc1' 'abc12' 'abc123'

I included the starter code that needs to be followed

import Java.util.ArrayLiSt: This class generates substrings of a string. public class SubstringGenerator ( public static ArrayList getSubstrings (String word) { //this is the value you will return ArrayList result = new ArrayList() ; //come up with a base case first // Below here is the recursive case /7 Form a simpler word by removing the first character // Generate all substrings of the simpler word /7 This is where you will make a recursive call /1 You can store the result from this temporary call in /1 your results ArrayList // Add all strings that start with word.charAt (0) // You will need a loop here // Return all substrings return result