In the LL(1) Parsing table of the given CFG, how many valid non-blank entries will be there in the rows for variables 'B' and 'D'?

Explanation

In an LL(1) table, a production X → α adds one entry per terminal in FIRST(α), and if α is nullable, X → ε also adds one entry per terminal in FOLLOW(X). For B → +AB | ε: the +AB alternative gives an entry at '+', and the ε alternative gives entries at FOLLOW(B) = {], $}, for 1 + 2 = 3 entries in row B. For D → *CD | ε: the *CD alternative gives an entry at '*', and the ε alternative gives entries at FOLLOW(D) = FOLLOW(A) = {+, ], $}, for 1 + 3 = 4 entries in row D.