A)if a grammar is left linear or right linear grammar then we can drow a dfa .
But here grammar is not left or right linear grammar . So we cant drow DFA.
B)L={ab,ba,abab,aabb,baba......}
Language gives equal no of a's and equal no of b's .
C) it is a CFL but not regular . Then we can not drow FINITE AUTOMETA. we can drow PDA for this.