(5 marks) Given the formal description below (to be discussed in class on January 27), draw the corresponding state diagram. Then, identify the language accepted by the finite automaton. Try to describe the language in the simplest terms possible. - Q={A,B,C,D,E} - ={a,b} - q=A - F={C} - :QQ is defined in the following table