please answer in java do not copy and paste from other answers you will get downvoted. please answer only if u know how to.

The program shown below counts the occurrences of words in a text, and displays the words and their occurrences in alphabetical order. Suppose you have a dictionary that maps words of different forms to their root forms. For example, the dictionary maps verbs nee, sees, seeing, sau, and seen to their root form see. Write a program that counts the occurrences of words in a text, treating all forms of a root word as the root word. import java.util. public class Count Occurrencer Words public static void main(String args) { 1/ Set text in a string String text - "Good morning. Have a good class "Have a good visit. Have fun!" // Create a TreeMap to hold words as key and count as value Map map - new TreeMap(); String 0 words - text.split("\*+\\p{P)]*); for (int i = 0; i 0) { if (Imap. contains Key (key)) { map.put(key, 1); else { int value = nap.get(key); 2 value; map.put(key, value): 3 3 > // Display key and value for each entry map.forEach(ck, v) -> System.out.println(k . "\" + v))