Course: Language and Compilers $($Automata$)$ Please give the diagram for each of them for a like. $1-$ Find dfa's for the following languages on $\backslash$Sigma $=\{$a$,$ b$\}.($a$)$ L$=\{$w: na$($w$)3>1\}.($b$)$ L$=\{$w:$|$w$|5!=0\}.($c$)$ L$=\{$w: n$\_$a$($w$)3>$n b$($w$)3\}.($d$)$ L$=\{$w:$|$w$|3=0,|$w$|!=6\}.$