assume
S---> aX |aYb
first(aX)= a
first(aYb)= a
so there will 2 entries for S in terminal 'a' which violates the rule of LL(1) grammar Bcoz for every variable and for every terminal there can be at most 1 production .
hence ,their intersection should be ∅
first one statement is correct
second one is true with similar reasoning as for first.
now third assume example
1) S-->aSA | ∈
2) A--> C |∈
now take 2) production
first(c) = c
follow(A) = follow(S) = => first(A)= c,∈,$
now the first(c)∩ follow(A)= c
means there will be again 2 entries for A in c place that means again violation of LL(1) rules.
so first(c)∩ follow(A)= ∅ is true.
hence answer is (D)