Test series compiler

Question

Let G be the following grammar:

S -> aBbD
B -> Sc | $\epsilon$
D -> BD | $\epsilon$
How many number of productions will be in G after elimination of all null productions only?

Comments

But isn't B contains $\epsilon$ and D too contains $\epsilon$ and so putting both in the production of D -> BD we will get one $\epsilon$ ?

---

We have to remove all epsilons! And in the case that you’re considering is applicable only for start symbol! Only on start symbol we have to preserve that epsilon if generating! Otherwise ignore it

---

Ok thanks for the clarification