HackerRank Java Anagrams problem solution

In this HackerRank Java Anagrams problem solution, you need to complete the isAnagram function that has two strings as parameters and if both strings are case insensitive anagrams then return true otherwise return false.

HackerRank Java Anagrams problem solution.

import java.io.*;
import java.util.*;

public class Solution {

    static boolean isAnagram(String firstWord, String secondWord) {
     char[] word1 = firstWord.toLowerCase().replaceAll("[\\s]", "").toCharArray();
     char[] word2 = secondWord.toLowerCase().replaceAll("[\\s]", "").toCharArray();
     Arrays.sort(word1);
     Arrays.sort(word2);
     return Arrays.equals(word1, word2);
    }
    public static void main(String[] args) {

        Scanner sc=new Scanner(System.in);
        String A=sc.next();
        String B=sc.next();
        boolean ret=isAnagram(A,B);
        if(ret)System.out.println("Anagrams");
        else System.out.println("Not Anagrams");

    }
}