Convert the following NFAs into equivalent regular expressions. Show all the intermediate steps $($i$.$e$.$

GNFAs$)$ and make appropriate comments to help graders understand your steps.

For example, step $1$: remove state $$q$0$; step $2$: remove state $$q$3,$ etc.

Convert the NFA in Figure $2$ into an equivalent regular expression.

Figure $2$: