Consider the regular grammar: S → Xa ∣ Ya X → Za Z → Sa ∣ ε Y → Wa W → SaS…

Consider the regular grammar:

S → Xa ∣ Ya

X → Za

Z → Sa ∣ ε

Y → Wa

W → SaS

where S is the start symbol, terminals = {a}, and non-terminals = {S,W,X,Y,Z}.

Construct a DFA that recognizes the same language as the above grammar and determine the minimum number of states required.