2. A binary string w is "framed" if [w] > 4 and it begins with "01" and ends with "10". Create a simple 5-state NFA that recognizes all framed binary strings, and then convert that to an equivalent DFA. Make sure every state in your final DFA has exactly one transition out for every symbol in the alphabet