1. Design a DFA for all strings over the alphabet a, b, 0, 1 such that if a string is starting with 0, then it should contain aba or abba; or if a string is starting with 1, then it should not contain ababa in it. Keep in mind that the symbols 0 and 1 must not appear anywhere after the first symbol.

2. Design a DFA for all strings over the alphabet x, y, z such that if the string contains any two of the symbols, then it should not contain the third.