Given a DFA M that recognizes a language L, give a general method you could use to construct an NFA that recognizes L*. the Kleene Star of language L. Recall that L* includes all strings that can be split into any number of pieces such that each piece is an element of L. Your solution should not be a specific example but should explain how to construct this NFA in general for any M