Write a regular expression and construct an equivalent finite automata

1. All strings which does not contain the substring ab.

2. All strings which contan even number of b's

3.All binary strings that have ever letter a followed by at least one letter b.

4. All binary strings not ending with ab.

5. Write regular expression for all the strings over the alphabet ={0,1,2} with an odd number of 1s

6. Give the context free grammers generating the following languages

a.The set of strings over alphabet ={b,c} with twice as many a's as b's.

b. The complement of the language {aⁿ bⁿ | n 0}.