Example 1 a) Show that the language (a n bAn cAn n 0 s Turing recognizable. Is it also Turing-decidable? b) Let = {a, b, c} corresponding to three candidates in an election. Give an implementation level description of a TM that recognizes if candidate a wins, i.e., she/he gets more votes than other candidates. Is your TM a decider