Note: This homework is about Deterministic Finite Automat (DFA) Q. 1 Maximum score 25 What language is accepted by the following DFA {Hint: Look for the strings which are NOT accepted} b a, b a b b a a b 0 Q. 2. Maximum score 25 Design a DFA which will accept all 1 strings that contain the substring 0101. The alphabet is {0,1}