Answer – B ( 1st and 4th )
as we know, every thing is decidable for regular languages.
and for CFL only 3 thing are decidable.
1st) Membership Problems ( Whether the given rammer is CFL )
2nd ) Emptiness problem ( The given language is empty or not)
3rd ) Finitness Problem( Means the given language is finte or not).