I'm working on a Java project that requires a method that accepts strings representing individual words. The method has to count the number of occurrences all two character sequences of letters are in those words. For example, ["banana", "bends", "i", "mend", "sandy"] gets "ba", "an", "na", "an", "na" from "banana"/ "be", "en", "nd", "ds" from "bends"/ "me", "en", "nd" from "mend"/ and "sa", "an", "nd", "dy" from "sandy"and then returns the count in a map, returning {an=3, ba=1, be=1, ds=1, dy=1, en=2, me=1, na=2, nd=3, sa=1}.