Answer and explain A- G

T/F questions. To get credit, you must give a brief reason for each answer, in the booklet.

a) T/F : if A B and B is a CFL, then A is a CFL.

b) T/F : If we remove a finite set of strings from a nonregular language, then the result is a nonregular language

c) T/F : if A has an NFA and B is a finite language, then A is context free

d) T/F: if A has a context- free grammar in Chomsky normal form and B is a decidable language then A B must be recognizable

e) T/F : if a language A is recognizable, then must be recognizable.

f) fill out the following table with T/F

Language	Decidable (DEC)	Recognizable (REC)
EDFA
EQDFA
EPDA
EQPDA
ETM
EQTM

g) T/F : CLIQUE is in P