Create a program in C where you implement a dictionary trie that provides the abilities for a caller to insert words to a tree to build a dictionary and search the tree to find if a given word matches (caseinsensitive search) any stored word in the tree.

You are given a text file called word.txt. This a large file with each word on a new line. The file is also in alphabetical order. Create a dictionary trie from these words. Take into consideration the 26 letters and apostrophe ().

Please use your own file also please comment code.