I'm trying to make an NFA from the following regular expression.

I'm not sure about the edges between nodes $q2$ and $q4$, maybe someone can point out where everything went wrong.
I'm trying to make an NFA from the following regular expression.

I'm not sure about the edges between nodes $q2$ and $q4$, maybe someone can point out where everything went wrong.
Copyright © 2021 JogjaFile Inc.
You should merge $q_2$ and $q_4$ and remove the $\lambda$-transitions between them, but keep the transition labelled by $c$. You should also replace $q_6 \xrightarrow{a} q_7$ by $q_5 \xrightarrow{a} q_7$. The states $q_6$ and $q_7$ should then be both final.