Answer is $(C)$
in S1, L is regular, DFA can be easily constructed for $nm \geq 3$, it is like drawing DFA for a*b* only here {ab,abb,aab} are not permitted.
in S2, consider string $aab$, given grammar gives $2$ parse trees for this string, hence it's ambiguous.
Therefore, both statements are true.
