Find an accepted set of all strings for the FA$,$ i$.$e$.,M,$ shown below. In other words, find the

language $L(M)$ where $M$ is an FA$.$ Your answer should be a set of binary strings.

Please draw it out and use diagrams to explain, I$\text{'}$m a visual learner! Thank you!