Hey guys! Im taking automata course and I have some questions:

-small stuf like..is every FA an NFA and vice versa..is Every TG an
FA and stuff like that..
-similarly..is every context free grammar context sensitive…or
context free..stuff like that
-given CFG,G1=(N1,T1,P1,S1)generating language L1 and ,G1=
(N2,T2,P2,S2)generating language
L2,find following context free grammars:
G3 which generates langauge L3=L1UL2
G4 which generates langauge L4=L1L2
-Find grammar equivalent to
S-->AB|CA
A-->a
B-->BC|AB
c-->aB|b
with no useless symbols

please please this one is very important!
-Define the grammar that generates the set of all words over {(,)} of
balanced paerthesis

-Convert the following language to Chomsky Normal Form

S-->aAb|bBa|AA
A-->S|B
B-->C
C-->S|A

I appreciate your time guys :) my exam is due next week so I'll be
very thankful if these are answered ;)