For each set below, is it F $($finite$),$ C $($countable infinite$)$ or U $($uncountable infinite$)\_\_\_\_\_\_$: Set of all recursively enumerable languages over the alphabet $\{0,1\}\_\_\_\_\_\_$: Set of all syntactically valid C programs$\_\_\_\_\_\_$: Set of all languages over the alphabet $\{0,1\}\_\_\_\_\_\_$: Set of all non$-$regular languages over the alphabet $\{0,1\}\_\_\_\_\_\_$: Set of all deterministic finite automata that will accept the language $1*0*1*\_\_\_\_\_\_$: Set of all DFAs that accept the language $(01)*(111)*$