Please help solve this with proper explanation and first 5 accepting and rejecting list.

D. (15pt) Use the construction given in the proof of Theorem 1.49 to give the state diagrams of NFAs recognizing the star of the languages described below 11. (5pt) A* for Az{w: w contains at least 3 1's} List the first 5 strings in the language: List the first 5 strings that are not in the language: 12. (5pt) B* for B = {at least two 0's and at most one 1} List the first 5 strings in the language: List the first 5 strings that are not in the language: 13. (5pt) C* for C = {01 +001 +010} List the first 5 strings in the language: List the first 5 strings that are not in the language: 0,1,00,10,11