L1∩L2 is a deterministic CFL because intersection of any lang. with regular is closed.
L3∩L1 is recursive is False because it should be RE {recursive enumerable not recursive}
L1∪L2 is context free is true, because every DCFL is CFL.
L1∩L2∩L3 is recursively enumerable is true.