#2. I dont understand how to do it step by step. Can you please include the solution WITH SIDE NOTES indicating why you did it this way and such

1. Use induction on n to show that " u for all strings u and all n. 2The reverse of a string, introduced informally above, can be defined more precisely by the recursive rules (wa)aw = aw , for all a E w *. Use this to prove that for all u, u E