Consider the grammar G with productions: S -> xAy | yAx A -> xAy | yAx | xAx |…

Consider the grammar G with productions:

S -> xAy | yAx
A -> xAy | yAx | xAx | yAy | epsilon

Let T be the total number of states and F be the number of final states in the minimum DFA for the language generated by G. Find the value of T - F.