Answer whether true or false with explaination in regards to theory of computation:

$1)$ If a regular language C has a finite number of strings concatenated to it$,$ the new resulting language remains regular.

$2)$ The language $\{\backslash$epsi $\backslash$cup $01\backslash$cup $0011\backslash$cup $000111\backslash$cup $...\}$ is a regular language.

$3)$ For a given specific DFA, if one language X is not recognized by it$,$ then X must be a non$-$regular language.

$4)$Non$-$deterministic Finite Automata $($NFAs$)$ are capable of recognizing a wider class of languages compared to regular expressions

$5)$ If A is a regular language and B $$ A$,$ then B must necessarily be finite.

$6)$ The regular expression that generates the language consisting of all strings over $\backslash$Sigma $=\{0,1\}$ having an odd number of $0$s is $(01^*0\backslash$cup $1)^*0$

$7)$ If A$,$ B and C are regular languages, then $($A $\backslash$cup $($B $$ C$))^*$ is also regular.

$8)$ Every Non$-$deterministic Finite Automaton can be regarded as a specific instance of a regular expression and vice versa.

$9)$ If one language is not a regular language, and X is the subset of that language, then X is also not regular language.

$10)$ The empty set is not considered a regular language.