A derivation of a string

of length n in a context$-$free grammar:

Group of answer choices

B$)$ must involve exactly $2$n $1$ applications of rules, except possibly when n $<=5.$

D$)$ must involve at least n rules and at most $2$n rules.

C$)$ must involve at least n rules, but can involve an arbitrarily large number.

A$)$ must involve exactly $2$n $1$ applications of rules for all n$.$

E$)$ can involve any positive integer number of rules.