Q. Consider the grammar shown below S → i E t S S' | a S' → e S | ε E → b In the predictive parse table. M, of this grammar, the entries M[S', e] and M[S', $] respectively are

• (A) {S' → e S} and {S' → e}
• (B) {S' → e S} and {}
• (C) {S' → ε} and {S' → ε}
• (D) {S' → e S, S'→ ε} and {S' → ε}