Question I: Let A={anbncn | n ≥ 0 }.
i. Is A a regular language? Why? Prove your answer formally.
ii. Is A a context free language? Why? Prove your answer formally.
iii. Is A Turing recognizable? Why? Prove your answer formally.
Question II: What is Class P problem? What is Class NP problem? Describe the relation of Class P and Class NP?