Consider the DFA defined by its transition graph as below. q1 93 8 100 O U O 94 Given a DFA, we define the notion of a regular expression R) for the language L(4) consisting of all strings that go from state q; to state q; without visiting a state numbered larger than k along the way (visiting the first and last state is not considered). For the DFA given above, specify the following regular expressions. You do not need to justify your answer. (0) R (0) R2 (0) R11 (4) R