How to Construct a Finite State Machine which accepts the word STRAWBERRY, LEMON, LYCHEE, LIME and LANGSAT by using different accepting state for each of the word?
