L1 : {aa,aaa,aaaaa,aaaaaa,......}.It is CSL because prime numbers does not have a fixed pattern.
L2 : push a push b then pop one b for each 2 c's and accept it when top of stack has a.It is DCFL.
L3: for a and b then for b and c two comparisons and therefore two stacks are required .It is CSL.
L4 : Classical example of DCFL. Push a then pop a for each b.
Options
I. wrong because L1 is not CFL.
II. wrong because L2 is DCFL so it is CFL .
III. Right because every CSL is Recursive but not CFL.
IV. Right it is DCFL.
Since III and IV are only correct options Ans is D.