Which statement about Suffix Tree is correct?

A. a query can combine results from a logarithmic number of nodes B. its merge step usually needs auxiliary storage for arrays C. it can support pattern search in time proportional to the pattern length D. a node can store multiple keys and have multiple children