Computing FOLLOW sets for LL(1) grammar. Stuck on question
$FOLLOW\ (Y) = FOLLOW\ (D)$
  
  $FOLLOW\ (Y) = FOLLOW\ (E)$


A general Rule of thumb is, for any grammar


S -> XAB
A -> BC
X -> Bt


$
Follow (B) = Follow (S)  $
(Since there isn't anything after B in Production-1)

$Follow (B) = First (C) $ (Since C follows B in Production-2 and is a non-terminal)

$Follow (B) = t $ (since it follows B in Production-3 and is a terminal)