For each of the following regular languages below, provided an NFA that accepts the language.

1- (a b)(ab)(abb).

2- (abb) bba

Find a regular expression corresponding to each of the following languages over {0,1}.

1- The language of all strings containing exactly two 0s.

2- The language of all strings that do not end with 01.

3- The language of all strings that do not contain 000.

3- The language of all strings that contain an even number of 0s and an odd numberof 1s.