A. All CFLs are Recursive Hence Not a Proper Superset.
B. Push Down Automata Cannot Recognize Recursive Languages.
Option C is Right
Recursive Language is a Proper subset of Recursively Enumerable Languages.
Hence Recursive Languages are also called as Type 0.
D. Recursive Languages are Recognizable by Turing Machine ( By Halting Turing Machine.)
So Answer is: C & D