Problem #$3(5$ marks$)$

According to the book of "Cryptological Mathematics" written by Robert Lewand, arranged from most

to least common in appearance, the letters are: etaoinshrdlcumwfgypbvkjxqz. Write a Java program

that reads a text $($which can be multiple sentences$)$ from the file "inputEx$3.$txt$"$ and displays how many

of the first seven most frequent letters $(e,t,a,c,i,n,$ and s$)$ appear in the entire text. Count each letter

regardless of its case $($count both uppercase and lowercase$).$

Sample Content of "inputEx$3.$txt$"$

I love programming in Java because CMPT $166$ helps me to learn how to

program in Java.

Sample Output

Counting the first seven most frequent letters in the given text...

e: $6$

$t$:$2$

a: $8$

o: $5$

i: $4$

$n$ : $5$

s: $2$