Java Collections Write a method called pairCounts that 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: "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". (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 a Map. 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"

def second_largest(lst: List[int]) -> int:    """    Given a list <lst> of integers, return the second largest item in the list    without modifying <lst>. You cannot use any of python's builtin sorting    functions. Do not attempt to sort the list yourself either.     For example, an input [1, 2, 3] should return an output of 2, since 2 is    the second largest integer in the list.     Note that when we say second largest, we do not mean second largest    distinct element. That means that [1, 2, 4, 4] should return 4, not 2.    """don't use any imports,or any dictionaries, or dictionary methods.and try-except statements

In the following program skeleton, replace the < insert code here> line with theappropriate code. The resulting program should display the initial list of songs,prompt the user for a string of text to be replaced and then prompt for new text toreplace it. After making the replacement, it should display the updated list of songs.import java.util.Scanner;public class UpdateSongs{public static void main ( String [] args){Scanner stdIn = new Scanner(System.in);String songs =“ 1. Welcome to Your Life – Grouplove\n” +“ 2. Sedona – Houndmouth\n” +“3. Imagine – John Lennon\n” +“4. Bohemian Rhapsody –Queen\n”;String oldText, newText;< insert code here>}}Sample Session:1. Welcome to Your Life – Grouplove”2. Sedona – Houndmouth3. Imagine – John Lennon4. Bohemian Rhapsody –QueenEnter text to replace: LennonEnter new text: Dean1. Welcome to Your Life – Grouplove”2. Sedona – Houndmouth3. Imagine – John Dean4. Bohemian Rhapsody –Queen

def findOccurrences(s, ch):     lst = []     for i in range(0, len(s)):         if a==s[i]:             lst.append(i)     return lst Use the code above instead of enumerate in the code posted below. n=int(input("Number of rounds of Hangman to be played:")) for i in range(0,n):     word = input("welcome!")     guesses = ''     turns = int(input("Enter the number of failed attempts allowed:")) def hangman(word):            secrete_word = "-" * len(word)     print(" the secrete word " + secrete_word)         user_input = input("Guess a letter: ")         if user_input in word:         occurences = findOccurrences(word, user_input)         for index in occurences:             secrete_word = secrete_word[:index] + user_input + secrete_word[index + 1:]         print(secrete_word)     else:         user_input = input("Sorry that letter was not found, please try again: ")   def findOccurrences(s, ch):     return [i for i, letter in enumerate(s) if letter == ch]  *** enumerate not discussed in…