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

In particular, the children of a node should be ordered alphabetically.

b$)$ Provide an example of a string of length n over alphabet $\{$a$,$b$,$c$,$d$\}$ 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$).$

instead of providing guidance, i would prefer an actual drawing of the suffix tree, please and thanks!