The ble intelec processor Question 3 (34 points) Write a program that uses a Tree Map to store entries each of which consists of a word and its count. For each word, check whether it is already a key in the map. If not, add an entry to the map with the word as the key and value 1; otherwise, increase the value for the work (key) by 1 in the map. Words are treated as case-insensitive. Your program asks the user to enter a string as input. op Inc To test your program, input Mary has a lamb, a lamb, a little lamb; and John has a horse, a horse, a horse. Mary and John both are happy, very happy. What a happy couple! Are they really happy? Then the output should be and 2 are 2 both 1 couple 1 happy 4 has 2 horse 3 john 2 lamb 3 little 1 mary 2 really 1 they 1 very 1 what 1