Which best describes the space requirements of a single (internal) node in a traditional trie data structure?

A. The number of pointers is always one

B. The number of pointers is always two

C. The number of pointers depends on the size of the alphabet

D. The number of pointers depends on the number of words in the trie

E. The number of pointers depends on the number of words beginning with the prefix of letters that got us to this node