Consider the following NFA A over {a,b} : A is intended to recognize the language L = {...

Consider the following NFA A over {a,b} :

A is intended to recognize the language
L = { zαb | z ∈ {a,b} ,α ∈ {a}∗ }
of strings over the alphabet {a,b} that start with either a or b, end with b and have an arbitrary number of a’s between the first and the last letter.
Use the “subset construction” algorithm or “tabulation method” to produce a deterministic finite automaton AD that recognizes L(A).