$($a$)$ Describe the languages denoted by the following regular expressions and design automate that accept these languages:

$[2$M$]$

i$)a(a|b)**a$

ii$)$ aba$($b$)$ Convert the followino NFA into DFA

$[1$M$]$