Via subset construction, construct DFAs from all three NFAs that were constructed in problem 1(already has been solved).

Please show step-by-step solutions.

Problem 1 with solutions:

Construct NFA that recognizes following languages: 1. All binary numbers that contain 00 or 11 2. All binary numbers that contain a l in the 3rd location from the right (e.g. 100, 10111, ...) 3. All binary numbers that can be divided by 3