How do I solve this problem?

Build a method calledpairCountsthat accepts a list of strings representing individual words and counts the number of occurrences of all 2-character sequences of letters in those words.

For example, suppose the list contains["banana", "bends", "i", "mend", "sandy"]. This list contains the following two-character pairs:

1. "ba", "an", "na", "an", "na"from"banana";
2. "be", "en", "nd", "ds"from"bends";
3. "me", "en", "nd"from"mend"; and
4. "sa", "an", "nd", "dy"from"sandy".

(Note that"i"is only one character long, so it contains no pairs.) Your method should count the occurrences of these pairs of letters and return the counts as aMap. In this case you would return{an=3, ba=1, be=1, ds=1, dy=1, en=2, me=1, na=2, nd=3, sa=1}. Notice that pairings that occur more than once in the same word should be counted as separate occurrences. For example,"an"and"na"each occur twice in"banana".