$\mathrm{A}$ is undecidable but recognizable.
$\text{B}$ is unrecognizable.
$\mathrm{C}$ is undecidable but recognizable.
$\mathrm{D}$ is decidable. There is no input $n$, such that ALL TMs halt on $n.$ So, statement in option D is Trivially Not true, hence, decidable.
GO Classes Complete Revision, Marathon \& Practice on Decidability, Undecidability, Rice Theorem: https://youtube.com/playlist?list=PLIPZ2_p3RNHiMGiPFIOPJG_ApL43JkILI&feature=shared
After watching the above playlist, you can solve more than $95 \%$ questions on Decidability easily.