Theory of Computation

please solve the following questions.

you can check this book " an introduction to formal languages and automata 6th edition "

" please solve all the selected questions "

3. Do Exercise 11(f) of Section 2.1 at page 50.

1. Do Exercise 34 of Section 1.1 at page 16. 34 Let (V, E) be any graph. Prove the following claim: If there is any walk between vi e V and vi e V, then there must be a simple path of length no larger than V 1 between these two vertices