Computing Theory problems about Context Free Languages and Computability Theory -- 3

You are required to solve and provide a proof of problems about theoretical computing and computability theory (Turing Machines). You will be paid only for those problems you solve and provide a detailed proof. This forms part of a project to review the entire solutions of many problems, which will be posted in future projects.