Question: 1 of 2 (Points: 15) AP Strings: Solve the Riddle Sophie loves patterns, and this time she come across patterns in string Her mother gave her two stringa of size , String A and String B. M Her mother asks her to check if there exists any permutation of string such that the difference between the characters at similar indices in the string remains the same Given Turns, print Yes if permutation exists and No if permutation doesn't exist Function Description In the provided code snippet, Implement the provided IfExists(...) mothod using the variables to check whether such permutations exist or not. You can write your code in the space below the phrase "WRITE YOUR LOGIC HERE". There will be multipla tast cases running so the input and Output should match exactly as provided The base Output variable result is set to a default value of -404 which can be modified. Additionally, you can add or remove these output variables OpenJDK V8.92.14 Java 7 irport java.util.; 2 Trrt java.lang. +; 3 irport 4.10.; 4 irport java.lang. Mathi 9 . public class man ( 7 public static int stExits(int n, String a, string Di { // this is default OUTPUT. You can change it. int result 404; 10 11 //write your Lopic here 12 11 14 return result: 15 10 3 17 public static void main(String args) 18 19 Scanner scenen Scanner(Systen.in); 2e //INPUT [uncounent & modify if required] 21 intti 22 T-sc.nextInt(); 21 intl N - new int[T]: 24 Stringil A = new Stringit); 25 String[] B - neu String[T]: 20 27 forint 1-0:1 T:++) { 28 NII - se.nextInt(); 29 All-sc.nextil 3e B[1]-sc.next11: 31 1 32 sc.close(): 31 //OUTPUT [uncontent & modify if required] 34 forint i=0;i