CFG is accepted by push down automata (PDA) as it requires a stack (eg : same number of a's and b's - for this the count of number of a's has to be remembered which cannot be done in finite automata) therefore we go for PDA
regular --> dcfl --> ncfl --> Csl --> recursive -->recursive enumerable
A CFG is also CSL , Recursive and recursiely enumerable
A CFL is accepted by linear bounded automata(LBA)
Since CFG is also CFL , it is also accepted by LBA
ANS - both B and C
