Please Make compressed suffix trie for each two case.
1. Let ST be the compressed sux trie for the stringMISSISSIPPI$. What is the number of nodes in ST?
A. 17 B. 18 C. 19 D. 20
(Answer : C)
20 Let ST be the compressed sux trie for the string BANANAS.What is the number of nodes in ST?
A. 7 B. 11 C. 13 D. 17
(Answer : B)
Expert Answer
An answer will be send to you shortly. . . . .