Write a method that recursively swaps groups of letters down to the 'minLen' length of a group. For example, if 'str' is "testing" and 'minLen' is 2, first "testing" would become "ingttes" where the "ing" and "tes" were swapped but the "t" in the middle stayed in the same spot. Then in the next step, "ingttes" would become "gnitset" because the three letter groups "ing" would be swapped for "gni" and "tes" would be swapped for "set". The parameter 'minLen' will be a positive integer and 'str' will contain a short enough string that you should not get timeout errors if you solve the problem correctly. You MUST use recursion to solve the problem.