Regular Expression to NFA

A semi quick example of converting a regular expression into a nondeterministic finite automata.

[@dtalmood]

This was super helpful, thank you man

[@MariamingAround]

Thanks

[@Level1Code]

Shouldn't b have been Yellow, since b for Banana ?

[@arshadallawi8928]

Could you please solve this question for me:
a+
Is it the same as a*?

[@jocelyngonzalez3575]

no, a+ means one or more a and a* means zero or more a