Non Deterministic Finite Automata Solved Example 3

TOC: NFA Solved Problem 3. Topics discussed: 1. NFA for: L1={Set of all strings that ends with "1"} 2. NFA for: L2={Set of all strings that contains "0"} 3. NFA for: L3={Set of all strings that starts with "10"} 4. NFA for: L4={Set of all strings that contains "01"} 5. NFA for: L5={Set of all strings that ends with "11"}.