JAVA

PLEASE ANSWER THIS QUESTION AFTER CHECKING THE VERSION 1 IN THE LINK BELOW

https://www.chegg.com/homework-help/questions-and-answers/version-1-first-version-must-write-recursive-method-called-permu-accepts-shortstr-needed-p-q44105392

THANK YOU

Version 2: In this second version, you will need to provide and alternative/smarter solution (to solve the same exact problem as above) however this second solution must significantly have lower time complexity than you first version. The solution may or may not use recursion; this is up to you. a) Explain the details of your algorithm, and provide its time complexity. You must clearly justify how you estimated the complexity of your solution. Version 2: In this second version, you will need to provide and alternative/smarter solution (to solve the same exact problem as above) however this second solution must significantly have lower time complexity than you first version. The solution may or may not use recursion; this is up to you. a) Explain the details of your algorithm, and provide its time complexity. You must clearly justify how you estimated the complexity of your solution