jayayb48132 jayayb48132 01-01-2024 Engineering contestada Show an NFA that accepts all binary strings with two 1’sin a rowor that contains three 0’s in a row.NFA = Nondeterministic finite automatonPlease explain and show all work.