Chapter 13 Text Processing On Page 593, implement the Suffix Tries. That means implementing a function to create suffix trees for an string. The input of the function is string, the output of the function is two suffix tree, one is the regular format, another is the compact representation. Running your code on the example in Figure 13.11. Your program should print out the two trees in Figure 13.11 (a) and (b).

(b) Figure 13.11: (a) Suffix trie T for the string X= "minimize". (b) Compact representation of T, where pair j..k denotes the substring X[j..k] in the reference string