The statement in your answer should have been this - "(A) is wrong as a language can be context-free even if it is being not accepted by deterministic PDA for e.g., ...". We don't care whether a CFL is accepted by a non-deterministic PDA or not. Here we concentrate on Deterministic PDA. The key concept here is NDPA ≠ DPDA, i.e., to say NDPA is more powerful than DPDA.