please help me to finish this proof other direction

5. Closure Prove that the regular languages are closed under each of the following operations: c) reverse(L.) - :- for some wel We know that all regular languages are closed under reversal of language. What this mean is that if we have a regular language (LI) and we reverse it to Language (L). if L is regular it would be accepted by some DFSM. Let M (K., 6, 5, A) Let M = (K'. 4,898, A'), where A' = s, 8(8.c) = 4, A E A For each [..c) = we have 8'(c) = 4 We want to show: w L(M) = WRE LON) Assuming weL(M): WW2, ..., on R = ......, For M: 8(, wy) - 4...8...) = a A because of definition of Mand w L For M: 8'(8.c) = a 1,5(a, w.) = 9n-1, ..., 6'(92.0) = 8 *EA' w L(M) "n L(A) (3.0) - M(a.) E A - (...) HM (8.c) E A