Question $5.$ Design a DFA or NFA that recognizes binary strings with at least two Os or at least three $1$s$.$ Question

$6.$ Recall that an NFA is a $5-$tuple $N=(Q,,,qO,F)$ for finite set of states $Q,$ finite alphabet $,$ transition function $$:$QP(Q),$ start state $q0$inQ, and accept states Fsube Q$.$ Give a formal specification of an NFA for the language described in Question $5.$

ANSWER question no $6$