in java

2.7 Valid Anagram Background An anagram is a word, phrase, or name formed by rearranging the letters of another, such as the word "cinema", formed from "iceman". See this video as an introduction to Anagram problems. Problem Statement Given two strings sandt, write a function to determine ift is an anagram of s. A sample main function is provided so that you may test your code on sample inputs. Inputs can be provided in the box below your code, please format your input as follows: Example input nose soen Requirements Spaces, tabs, and casing should be ignored. The expected input will only contain characters a-z, A-Z, tabs, and spaces. You are limited to 10 submission attempts. The inputs are NOT guaranteed to be the same length. Examples Example 1: Input: bear bare Output: true Example 2: Input: rAce Care Output: Output: true Example 4: Input: Queens College Computer Science Output: false LAB ACTIVITY 224.. 2.7.1: Valid Anagram 0/30 Solution.java Load default template.. import java.util.Scanner; public class Solution { public boolean isAnagram(Strings, String t) { // Add code below //Sample main to run tests public static void main(String args)) { //Variables Scanner scnr = new Scanner(System.in); Solution test = new Solution0; // Get test inputs String a = scnr.nextLine(): String b = scnr.nextLine(); // Run instance of solution on test cases boolean out = test.isAnagram(a,b))? true false; //Output result System.out.println(out)