Please show the answer step by step! thx!!!

NOTE!!!: Please only answer the Problem 2!!!

Problem 1

Construct NFA that recognizes following languages:

1. All binary numbers that contain 00 or 11

2. All binary numbers that contain a 1 in the 3rd location from the right (e.g.100, 10111, ...)

3. All binary numbers that can be divided by 3

Problem 2

Via subset construction, construct DFAs from all three NFAs that were constructed in problem 1.Please show step-by-step solutions.