$3.$ For S $=\{0,1\},$ produce the regular expression that start with TWO or more symbols followed by or more s

$4.$ For S $=\{0,1\},$ find a grammar that generate the language consisting of all strings with no more than THREE $0$s$.$ Construct the equivalent NFA$/$DFA for it$.$

$5.$ Find a contact free grammar that generate $.$ Construct the equivalent NFA$/$DFA for it$.$