Theory of Computation: Question 2 solve Apply formal description on M in the Finite Automata Dfa and part A and B full with steps and explanation and DRAW THE GRAPGH AND APPLY THE FORMULA LAW stated in the question above

Q is a Deterministic Finite Automata (DFA) shown below. Apply the DFA formal description on M. 2.5 marks 1. Answer the following Questions: 2.5 marks A. Consider the language L= strings of size divisible by 3} over the alphabet {a}. Use a DFA that represent all strings from L. B. Demonstrate the regular expression that describes the language in part A