please, include the explanation with your answer.

Trie Operations Unanswered Consider a trie data structure containing 65536 words, of which 85 begin with the character sequence EX. The trie's alphabet is limited to the 26 upper-case letters A-Z, and the longest word in the trie is 42 letters. How many character comparisons are required to search for the word EXAMINATION? 11 65536 Submit