Design a DFA which accept set of all substrings Start with bab| TOC |solved example| tricks

Problem: Design a DFA starting with following substrings 1. bab 2. abb 3. abba 4. abc 5. Three consecutive ones ⭐ Courses Playlist ⭐ 🔗 THEORY OF COMPUTATION    • Playlist   🔗FUZZY SET:    • DISCRETE MATHEMATICS   🔗SYSTEM PROGRAMMING (SP):    • SYSTEM PROGRAMMING (SP)   🔗COMPILER DESIGN | COMPILER | LANGUAGE PROCESSOR:    • COMPILER DESIGN | COMPILER | LANGUAGE PROC...   🔗DESIGN AND ANALYSIS OF ALGORITHMS (DAA)| ALGORITHM:    • DESIGN AND ANALYSIS OF ALGORITHMS (DAA)| A...   🔗Computer Architecture and Digital System:    • Computer Architecture and Digital System   🔗COMPUTER GRAPHICS (CG) BY. AHMAD SIR:    • COMPUTER GRAPHICS (CG) BY. AHMAD SIR   #CSEACADEMY #CSEACADEMY1 #TOCBYCSEACADEMY #TOCBYAHMADSIR #DFA #CONTAINING #SUBSTRING #TOC #automatatheory #byahmadsir #cseacademy #finiteautomata #typessofFa