Suppose you have a Hashmap hmap that stores letters of a word and their occurrences. For example: "Parallel" à {P: 1, a: 2, r: 1, e: 1, l: 3} Write a code that uses lambda expression and foreach to print the contents of the hashmap. (3 pts) Print the number of repeated characters and the sum of their recurrences. For example, in the word "Parallel", the number of repeated characters is 2 (a and l) and the sum of their recurrences is 5. (5 pts) Write a function to check if a specific character ch is there in the hashmap, if it’s there, print its recurrences, if not, print "Not Found". (5 pts)