If $M$ is a Turing machine that halts on all inputs, then there exists a

CFG G such that $L(M)=L(G).$

True

False