Answer True or False $($T$/$F$)$:

a$)$ An alphabet may be the empty set.

b$)$ An NFA must have a finite number of states.

c$)$An FA may be defined by two components: states and a transition function.

d$)$ An empty language can be denoted by$(\backslash$Lambda $).$

e$)$ A transition function is a function of two variables.

f$)$ FAs accept regular languages while NFAs accept non$-$regular languages.

g$)$ All NFAs can be described by transition diagrams.

h$)$ A complement of a regular language is always a regular language.

i$)$ If L $=\{$xyz$\},$ then L$*=\{$xyz$,$ xyzxyz$,$ xyzxyzxyz$,....$::$\}.$

j$)$ if L$1,=\{$a$,$ b$\}$ and L$2=(1,2\},$then L$1,$ l$2,=\{1$a$,1$b$,2$a$,2$b $\}.$