Solution:Both statement (A) and (B) are correct.
A. For every regular language, we can design a Turing Machine. Regular language are equivalent in power to the languages that can be recognized by a Turing Machine, So there exists a Turing Machine for every regular language.
B. For every context free language, we can design a Turing Machine. Similarly, context free language are also Turing -recognizable meaning there exists a Turing Machine that can recognize every contextfree language.