Find regular expressions over {0, 1} that determine the following languages: (i) {u | u contains an even number of 1’s} (ii) {u | u contains an odd number of 0’s} For each of the two languages...

Find regular expressions over {0, 1} that determine the following languages:

(i) {u | u contains an even number of 1’s}

(ii) {u | u contains an odd number of 0’s}

For each of the two languages mentioned, find the following that accepts exactly that set of strings.

1. Non Deterministic Finite Automaton


2. Deterministic Finite Automaton.