Draw an NFA for the language L3 of strings over Σ = {a, b, c} that start with ab, end with bc and contain abc as a substring (all three conditions must be satisfied). There are no other constraints on your NFA other than the usual guidance to be precise, clear, and show good use of the NFA model.

Explanation:

NFA means Non-deterministic Finite Automata and since it usually associated with DFA, we should know that DFA means Deterministic Finite Automata.

It is easier to construct an NFA than DFA for a given regular language. The finite automata are called NFA when there exist many paths for specific input from the current state to the next state.

Very important, Every NFA is not DFA, but each NFA can be translated into DFA.

For the answer you seek, the diagram is on the attached file section, kindly go through it.

answer; ///400 ibs;