$1.(2$ points each$)$ Mark the box next to True or False.

a$.$ True $$ False Regular languages are closed under intersection.

b$.$ True $$ False Regular languages are closed under Kleene star.

c$.$ True $$ False If a language, L$,$ is accepted by an NFA, L is a regular language.

d$.$ True $$ False The complement of a regular language is not a regular language.

e$.$ True $$ False Every regular language is finite.

f$.$ True $$ False The delta function for a DFA is a partial function.

g$.$ True $$ False The delta function for an NFA has as its range $2($powerset of $).$

h$.$ True $$ False If L is a finite language, then L is regular.

i$.$ True $$ False There exists a language, L$,$ that is recognized by an NFA but not any DFA.

j$.$ True $$ False Every language over a single$-$symbol alphabet is regular.