$[10$ pts$]$ Write a regular expression for a language $L,$ using the alphabet $\{a,b\}$ where all strings in the language $L$ starts with $"b"$ followed by any number of repetitions of the substring "aba" $($including none$),$ and ending with bb or ending with bba

$[10$ pts$]$ Draw a finite automaton that models the regular expression a

$[5$ pts$]$ Determine which of the following strings are accepted by the following Transition Graph $($TG$)$

a$.$ aba

b$.$ aab

c$.$ baab

d$.bb$

e$.$ aa