Please include all the answers ask by the question. (especially using kleene star construction)

3. Use the Kleene star construction presented in lecture (and outlined in Sipser's Theorem 1.49) to build the NFA accepting the Kleene star of the language {w E {a,b}* : #b(w) > 2}. For example, the strings abababab and abbbabbabb are in the language. First build the DFA of this language (which you should include as intermediate work), then build the NFA using the formal construction from lecture (in the proof that regular languages are closed under Kleene star). Note that you must follow the construction: it is not sufficient to build an NFA that accepts the language