For each of the following languages L. prove that there is no automaton that recognizes it. Here L is over the alphabet ? = {a, b}, unless otherwise indicated. (a) L= {ab3n | n >0} (b) L = {w WR | W E {a, b}*} (WR is the reverse of w.)? (c) L = {a, b,c}, L = {w E I* | #a(w) + #6(w) = #c(w)} For each of the following languages L. prove that there is no automaton that recognizes it. Here L is over the alphabet ? = {a, b}, unless otherwise indicated. (a) L= {ab3n | n >0} (b) L = {w WR | W E {a, b}*} (WR is the reverse of w.)? (c) L = {a, b,c}, L = {w E I* | #a(w) + #6(w) = #c(w)}