3. For each of the following langauges, State whether the language is finite or infinite. . State whether the language is regular or nonregular If you claim the language is regular: give a DFA (graphical representation) that recog nizes the language. If you claim that the language is not regular, describe the intuition for why this is so. Consider the following languages: (a) [8 marks] The language, over the alphabet 0, 1, 2, 3, such that the sum of all the digits (b) [8 marks] The language of decimal strings such that the number of digits less than 5 (c) [9 marks] The language, of binary strings such that the number of Os is odd and the (d) [Bonus 5 marks] L-(? e {A, B. C)'| |014-lola mod 2A]d|A |&le mod 2} is divisible by 4. is equal to the mumber of digits greater than 5. number of 1s is odd