Construct NFAs accepting the following languages over alphabet {0, 1}. Try to takeadvantage of nondeterminism as much as possible. Then, convert them to a DFA and minimize their number of states: 1. The set of all strings that each block of 3 consecutive symbols contains at least two 0s. 2. The set of all strings whose third or fifth symbol from the right ends as 1.