Consider the following context-free grammar where the set of terminals is {a, b, c, d, f}
S→daT|Rf
T→aS|baT|ϵ
R→caTR|ϵ
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 parsing table ("blank" denotes that the corresponding cell is empty)?