Q $6.[20$ Points$]$ Use generalized transition graphs $($GTG$)$ to convert the following NFAs

$($alphabet $=\{a,b\})$ into regular expressions. Show your work, i$.$e$.,$ intermediate GTGs$.$

i$)$

ii$)$