a$)$ Draw the suffix tree corresponding to the text $\backslash ($ T$=\backslash )$ omrosodomro.

Your suffix tree should look like the example on Slide $44$ of String$-$Algorithm module. In particular, the children of a node should be ordered alphabetically.

b$)$ Provide an example of a string of length $\backslash ($ n $\backslash )$ over alphabet $\backslash (\backslash \{$a$,$ b$,$ c$,$ d$\backslash \}\backslash )$ for which the suffix tree has a minimum number of leaves. All characters in the alphabet must be present in the string. Specify the number of leaves in the tree, and briefly justify your answer $($in one or two sentences$).$

c$)[$Bonus$]$ Provide an example of a string of length $\backslash ($ n $\backslash )$ over alphabet $\backslash (\backslash \{$a$,$ b$,$ c$,$ d$\backslash \}\backslash )$ for which the suffix tree has a maximum number of leaves. Specify the number of leaves in the tree, and briefly justify your answer in a few sentences.