The desired strings
start with an "a", end with a "z",
and have any number of "a-z" in the middle.
The language described by this automaton includes the strings:
az
acz
abcz
abzzz
abazbcz
alcatraz
azewababcz
QUESTION 4:
Design the finite state automaton.
Use a pencil and the back of an old envelope.