a Question 3. For each of the languages below, draw a transition diagram for a DFA which accepts that language. (3.a) Strings over 2 = {a,b,c} which begin with the character a and end with the character c. (3.b) Strings over = {a,b} in which the characters a and b always alternate. For example, strings ababa, bab, and a are in this language. (3.c) Strings over = {a,b} which end with either aa or bb. (3.d) Strings over = {0,1,2), such that the sum of all digits in the string is divisible by 4. For example, the string 02101 is in the language because 0+2+1+0+1 = 4, which is divisible by 4; but 1212 is not, because 1+2+1 +2 = 6 is not divisible by 4. tinnir to