Hi!! I would appreciate any help with a program that I am trying to write. There is a specific function that I am trying to write that give me the most frequent word in a Trie. I am having some trouble with it because I am confused on how to go about doing it. In my trie struct I have an "int count" field, intialized to zero that I increment every time a word is inserted into the trie. It is incremented at the terminal node of each string that is inserted. That is what I use to see how many times a word is present in the trie. For example if a string is inserted then the "int count" filed is increments at its terminal node which would then be 1, if the same string is inserted again now the "int count" field would be increment again at its terminal node and it would now be 2. What I want to be able to do is write a function that determines what string occurs most frequently in the trie. Also if two strings occur the same number of times in the trie I want to return the string that comes first in alphabetical order. I would like to be able to solve it just using the trie and some functions, while not implementing things like hash tables or anything like that, trying to keep the extra space used by the program to low. Below is my trie struct.

typedef struct trie {

int count;

struct trie *children[26];

}