In this assignment There are 3 problems and I need help with it.

Consider the NFA M in Fig. 1. Construct an equivalent DFA using exactly the Subset Construction method taught in the lectures (no other method will be accepted). Draw the state diagram of a DFA accepting all binary words that are not in the language (10 + 110)^*. Consider the method "M to M*", shown in the lectures, which constructs the lambda-NFA M^* accepting (L(M))^*, for any given lambda-NFA M. Use that method to construct M^* when given the NFA M in Fig 1 (no other method will be accepted). Use that method as a guide to describe a method that constructs a lambda-NFA M^+ accepting the language (L(M))^*, when given any lambda-NFA M