word.txt contains the words below each on a new line in alphabetical order

an

be

coals

colliers

I

Gregory

mean

well

RomeoandJuliet.txt contains

Gregory, on my word well not carry coals. No, for then we should be colliers. I mean, an we be in choler, well draw.

1. You will need to create TWO C programs.
2. First program- You will need to insert the words in word.txt into a dictionary trie. This trie should allow a caller to insert words to a trie to build a dictionary and search the trie to find if a given word matches (case insensitive search) any stored word in the trie.
3. Basically put word.txt in a dictionary trie
4. Second program- Next test your dictionary trie implementation by building a dictionary trie from a source dictionary text file and then use the dictionary trie to perform spell checks on all words read from another text file and print out all misspelled words there.
5. Basically, in this code you will use check to see if the words in RomeandJuliet.txt is spelled the same as in word.txt. If a word in RomeandJuliet.txt is not in word.txt then it is considered misspelled.

• This code should contain the main(int argc, char **argv)

6. Take into account the 26 letters and apostrophe ( ). It is also case insensitive.
7. Each misspelled word should be on a new line.
8. Please read in the two text files.
9. Print the misspelled words to standard out. You can capture standard out to a file using the > and a filename. Please show how to do this in command line. The misspelled words should be EXACTLY how they were in the Romeo and Juliet book.
10. Misspelled words are

on

my

word

not

carry

No

for

then

we

should

we

in

choler

draw