Write a method that scrambles a password using a prime-number 'jump' value. Return the scrambled string. For example, if the input parameter string is "ThisWasATest", and the 'jump' value was 5, you would build your resulting string this way: The first character would be the "T" from the first character of the original string. The next character is "a" because you jump 5 characters ahead. Next you jump ahead another 5 characters to get the "s" in test. The next jump would put you after the end of the string, so now you start the process over with the next character in from the front of the string. So now we add the "h" in "This", then jump to the "s" in "Was", then the "t" in "Test". The next jump would take us past the end of the string, so now we start over with the "i" in "This". The process continues until all of the characters have been rearranged following this patter. Here is a BIG hint: Use an array to build your new, scrambled string! Once you have the positions of all the characters figured out, build the resulting string from that array you made. You could also use an ArrayList if you prefer. As preconditions you may assume that the input string will have at least one character and that 'jump' will be a positive prime number (although for this pattern of jumping it would not really NEED to be prime).