Section 1 of 1 Question of Marks for this Questions 10 Upload answer sheets 6) Prove that the Language lunion Language in regular Language 1 All strings that contain an even number ofb's over the alphabet -a. b) Language 2. All strings which do not contain the substring ba over the alphabet I - (b) ii) Construct the minimum state automaton equivalent to the finite automaton given below 1 >90 *92 96 90 92 92 9 96 95 96 96 94 02 Once you upload files from your second device click on Sync to che Type here to search o Section 1 of 1 Question of Marks for this Questions 10 Upload answer sheets 6) Prove that the Language lunion Language in regular Language 1 All strings that contain an even number ofb's over the alphabet -a. b) Language 2. All strings which do not contain the substring ba over the alphabet I - (b) ii) Construct the minimum state automaton equivalent to the finite automaton given below 1 >90 *92 96 90 92 92 9 96 95 96 96 94 02 Once you upload files from your second device click on Sync to che Type here to search o