You're inserting $n$ distinct strings, all of the same length $k$ into an Aho$-$Corasick Automaton. Given only this

information, which of the following can you deduce about the resulting automaton?

a$.$The number of nodes in the automaton

b$.$The number of failure links in the automaton

c$.$The number of dictionary links in the automaton

d$.$The memory $($in bytes$)$ occupied by the automaton

e$.$The number of leaf nodes in the automaton

f$.$The height of the automaton

g$.$None of the above

NB:$-$ to let you know it's not one or two answer it's more than that!!