EXERCISE 6 (This exercise refers to material from Appendix A.) Let M be this DFA: Give the simplest regular expression you can think of for each of the following internal languages of M. (Use the d2r construction if necessary.) a. LKM, 2, 2, 3) b. LCM2, 2, 2) c. 1(M, 1, 1, 3)