Directions:SHOW ALL YOUR WORK. REMEMBER THAT PROGRAM SEGMENTS ARE TO BE WRITTEN IN JAVA.Notes: Assume that the classes listed in the appendices have been imported where appropriate. Unless otherwise noted in the question, assume that parameters in method calls are not null and that methods are called only when their preconditions are satisfied. In writing solutions for each question, you may use any of the accessible methods that are listed in classes defined in that question. Writing significant amounts of code that can be replaced by a call to one of these methods may not receive full credit.This question involves reasoning about strings made up of uppercase letters. You will implement a method that takes a single string parameter and returns a scrambled version of that string.Part a$.$ Write the method scrambleWord, which takes a given word and returns a string that contains a scrambled version of the word according to the following rules. The scrambling process begins at the first letter of the word and continues from left to right. If two consecutive letters consist of an $"$A$"$ followed by a letter that is not an $"$A$",$ then the two letters are swapped in the resulting string. Once the letters in two adjacent positions have been swapped, neither of those two positions can be involved in a future swap.The following table shows several examples of words and their scrambled versions.wordResult returned byscrambleword $($word$)"$TAN$""$TNA$""$ABRACADABRA$""$BARCADABARA$""$WHOA$""$WHOA$""$AARDVARK$""$ARADVRAK$""$EGGS$""$EGGS$""$A$""$A$"$