how can I prove that every regular language has a finite index?
can I use the Myhill-Nerode-theorem.
I tried to use the fact that: 

δ*(v) = δ*(w) => v~w 
![enter image description here](https://i.sstatic.net/Fm3zR.jpg)