finite no of striings....means we can do it with a finite state machine...means L1 is regular

regular intersection CFL is CFL

so option C

Answer will B according to me

Exp::

Since string are finite therefore it must be CFL let us say L1 and second CFL let us say L2

L1 ⋂ L2 will not be CFL,Bcz it is not closed under the intersection.Therefore it must be CSL..