For the following finite state machine:
The language recognized by it is given to be: $0+(10+11)(0+1)^*$ in my samples book, which I think is clearly wrong, since there's no return path to the final state.
I think the language recognized should be just an epsilon or nothing. I wanted to confirm if I am right or wrong with the answer.