Can someone please explain what happens if the first Terminal if actually recursive? So I know why FIRST(S) = { FIRST( S ), FIRST( A ) }

i know the first of A is {a, b, EPSILON}, but what would be the first of S? The answer says {a, b, c, EPSILON, d}. Do we remove S and move to C.

Thanks

nuo Do SC | AB A + a 1 bl & c | d | E 1111