(A) The intersection of two recursively enumerable languages is recursively enumerable. This statement is true because REL is closed under intersection operations.
(B) the intersection of two context-free languages is context-free. This statements is false.(it may or may not be closed).
Eg: Let $L_1={a^nb^nc^m/m,n\geq0}$
$L_2={a^nb^mc^m/m,n\geq0}$ but
$L_1\cap L_2={a^nb^nc^n/n\geq0}$ is non-CFL language
(C) The intersection of two recursively languages is recursive. This is true because REC language is closed under intersection operations.
(D) The intersection of two regular languages is regular. This is also true.
eg: $L_1=a^*$ accept the strings like $(\epsilon,a,aa,aaa,aaaa…..\infty)$
$L_2=a^+$ accepts the strings like $(a,aa,aaa,aaaa….\infty)$
$\therefore L_1\cap L_2=\epsilon$ which is regular language, a finite automata with initial states is accepting states.
So option $A,C,D$ is true whereas $B$ is false.
Ref: Closure Property of Language Families