Which of following problems are undecidable?I. Membership problem in context-free languagesII. Whether a given context-free language is regularIII. Whether a finite state automation halts on all inputsIV. Membership problem for type 0 languages

• A. I and IV
• B. II and IV
• C. III and IV
• D. I and II