1.Construct an NFA over sum from blank to blank of = {0, 1} with no more than 5 states for the language L = {0101n : n >= 0} U {010n : n >= 0}

2.Construct an NFA over sum from blank to blank of = {0, 1} with no more than 3 states for the language 1* (001+)*

Note: if you upload imagies, please write it clealy and shoot it visibly.