$==$ Let M $=($Q$,2,5,$ s$,$ F$)$ be an NFA, where Q $=\{90,91,92\},\{=\{$a$,$ b$,$ c$,$ d$\},\{8(90,$ a$)=$ q$0,5(90,\backslash$epsi $)=$ q$1,(91,$ b$)=91,5(91,$ c$)=91,5(91,\backslash$epsi $)=92,8(92,$ d$)=92\},$ s $=90,$ F $=\{90,91,92).$ The regular expression that corresponds to the language accepted by M is: $($abcd$)*$ a$*$b$*$c$*$d$*($aUbUcUd$)*$ a$*($bUc$)*$d$*$ none of the above $$Context$-$Free languages are closed under: o Complement Union O Intersection o Set Difference none of the aboveDecidable languages are closed under: Complement Union Intersection Kleene Closure none of the aboveA language is regular if and only if it is: O recognized by DFA recognized by a PDA recognized by a LBA accepted by a Turing machine