For each of the following languages, find a phase-structure grammar that generates the language, a regular expression that describes the language, and a non-deterministic finite automaton that recognizes the language.

1. the set of all strings containing more 0s than 1s

2. the set of all strings containing equal number of 0s and 1s

3. the set of all strings starting with an even number of 0s and ending in an odd number of 1s