Java code

In your first version, you must write a recursive method called permu, which accepts shortStr (and any other needed parameters; i.e. start index and end index) and generates ALL possible permutation of that string. For each possible permutation value, the method should find out (possibly by calling another method), whether that permutation value is a substring of longStr. Your code must show all permutations and for each of them should indicate whether or not this value exists in longStr. For example; given longStr as hhlajkjgabckkkkcbakkdfjknbbca",and shortStr as abc", the method should show display something like: abc Found one match: abc is in hhhlajkjgabckkkkcbakkdfjknbbca at location 9 acb bac bca Found one match: bca is in hhhlajkjgabckkkkcbakkdfjknbbca at location 27 cba Found one match: cba is in hhhlajkjgabckkkkcbakkdfjknbbca at location 16 cab