Consider the following context-free grammar where the set of terminals is {a, b, c, d, f}.S → d a T | R fT → a S | b a T | ϵR → c a T R | ϵThe following is a partially-filled LL(1) parsing table.Which one of the following choices represents the correct combination for the numbered cells in the parsing table ("blank" denotes that the corresponding cell is empty)?

• A. (1) S → R f (2) S → R f (3) T → ϵ (4) T → ϵ
• B. (1) blank (2) S → R f (3) blank (4) blank
• C. (1) S → R f (2) blank (3) blank (4) T → ϵ
• D. (1) blank (2) S → R f (3) T → ϵ (4) T → ϵ