Consider the following regular grammar G$.$ Write a regular expression that generates L$($G$).$ Draw the equivalent DFA.

S $->$aT

T $->$ bT l a w I E

W $->$a W $|$ E

E here is lamda