4. Consider the following languages. ANFAFIN-N) N is an NFA and L(N) is finite) . EREX-((R) I R is a regular expression and L(R) = 0} . EQREXR R2) Ri and R2 are regular expressions and L(R L(R2)) EQNFAFINSET N, U) N is an NFA, U is a finite set of words, and L(N)-U . ALLREx-R R is a regular expression and L(R) 0,1 (a) Answer the following questions based on the NFA N as shown below. Simply say yes or no go Ti (i) Is (N) E ANFAPIN? (ii) Is ((01)*) E EREX (iii) Is (00,0'0) E EQREx? (iv) Is N. {0, 01 . 0110E EQNFAFINSET? (v) Is ((01)*(01)*)|0) E ALLREX (b) Is AyFAPIN decidable? If yes, please give a Turing machine which decides ANPAPIN (a high- level description with stages is enough); otherwise, please prove it, say, by contradiction (c) IsEQNEA FINSET decidable? Ifyes, please give a Turing machine which decides EQNFAFINSET (a high-level description with stages is enough); otherwise, please prove it, say, by contra- diction