Convert the following NFA to a regular expression:NFA to RE$.$Transform the following NFA to a regular expression $($hint: convert to a

generalized nondeterministic finite automata $($GNFA$)$ and reduce number of states$)$