Please answer!

P1. Answer TRUE or FALSE for each statement (No explanation is needed) (a) Every regular expression can be converted to a CFG (b) Every CFG has an equivalent NFA (c) Aqy is unrecognizable (d) EQTx is recognizable (e) Eco is decidable P2. Let L1={binary strings with odd number of O's) and L2={binary strings begin with 01}. (a) Construct DFA for L1 (b) Construct NFA for L2 (which is not DFA) and then convert it to DFA (c) Construct DFA for L1 U L2 (union)