Which of the following statements are TRUE for a string S of length$$N$$characters$?$

Select one or more:

a$.$ If all characters of S are the same character, both the suffix trie and suffix tree will have the same space complexity.

b$.$ If string T is a substring of S$,$ there will always be a path from the root to a leaf in the suffix trie

corresponding to string T$.$

c$.$ There are $($N$\backslash$deg leaves in the suffix trie.

d$.$ There are O$($N$)$ nodes in the$$suffix$$trie$.$