Section 1. (1 point each, range of course learning outcomes (CLOs)) Mark the following statements with True if they are true and False otherwise. It was shown that nondeterministic finite automata is more powerful than deterministic finite automata. L= {0'10" | n>=1 and m>=n} is a Context-Free Language. L= {0"1" | n >=1}U {OM13mm >=1} is a Context-Free Language. L= {wcw | We{0,1}*} is a Context-Free Language. L= {OOn 1m n>=1 and m>=0} is a regular language. A grammar is ambiguous if there exists a word w with two distinct right-most derivations for w. All finite languages are regular. A function f with domain D is said to be Turing-computable if there exists some Turing machine M = (Q, , I, 6, go, Q. F) such that gow - arf(w), 9 E F for all w ED. The grammar S aScaSA: A bAc accepts the language L = {angmcn+m}. +