IN JAVA PLS

Problem Statement Say that two words w1 and w2 are neargrams if they contain the same set of characters and, for every character in that set, the number of times the characters appears in one word is within +/1 of the number public class Neargrams \{ of times it appears in the other word. For example, "anaa" and "anna" public int numOfNeargrams(String words) \{ are neargrams, because both contain 'a's and 'n's, and the first word has 3 'a's and 1 ' n ' and the second has 2 'a's and 2 'n's. You are given string words consisting of space-separated words. Return an int equal to the number of unique pairs of words that are neargrams. Do not count a word as a neargram of itself and be careful not to double count pairs. Constraints - words contains at-most 50 unique space-delimited words, all lowercase, with no leading or trailing spaces. Examples 1. words = "ffishh fiish" returns: 1 "ffishh" and "fiish" are neargrams. 'f', ' i ', 's', and 'h' are the characters in both. The first has one more 'f' and 'h' and the latter has one more 'i