Given a grammar G for a language, which of the following must hold in order for recursive descent parsing to be feasible?

Choice $1$ of $4$:for some nonterminal X in G$,$ for some pair of grammar rules for X$,$ the FIRST sets of the bodies of the rules must be disjoint.

Choice $2$ of $4$:for some nonterminal X in G$,$ for every pair of grammar rules for X$,$ the FIRST sets of the bodies of the rules must be disjoint.

Choice $3$ of $4$:for every nonterminal X in G$,$ for some pair of grammar rules for X$,$ the FIRST sets of the bodies of these rules must be disjoint.

Choice $4$ of $4$:for every nonterminal X in G$,$ for every pair of grammar rules for X$,$ the FIRST sets of the bodies of these rules must be disjoint.