snow

flex

pose

pose

pose

tank

seat

hero

snow

talk

city

link

paid

info

miss

tank

soar

talk

gold

snow

cafe

view

snow

view

tank

talk

peck

bean

bean

soar

lung

heel

seat

seat

pose

barn

heel

info

link

debt

miss

barn

pine

pose

flex

miss

flex

miss

snow

bean

bean

cafe

talk

seat

soar

link

link

heel

bean

tank

bean

view

pose

paid

hero

talk

salt

salt

peck

seat

cafe

seat

link

debt

tank

info

view

flex

cafe

pine

view

flex

gold

barn

info

seat

seat

seat

link

peck

cafe

heel

barn

peck

hero

tank

cafe

miss

heel

pineInstructions

The attached file "wordlist.txt$"$ contains words, each stored on a separate line. Develop an

algorithm in the form of a Raptor flowchart to compute the frequencies of words starting with

same letter of the alphabet. The output shall be displayed using the following example format.

Note that the following is just an example to illustrate the format required for the output and is NOT the

expected output of the algorithm for the provided "wordlist.txt$"$ data file.

For the illustrated example output format, shown above, the input file includes one word that

starts with $c,$ one word that starts with $f,$ one word that starts with $h,$ three words that start with $p,$

three words that start with $s$ and two words that start with $t.$

Hint: Sort the words stored in the input file "wordlist.txt$".$ Traverse the array of sorted words,

and for each new word starting letter, count the number of words that start with such letter