Give a decision procedure $($algorithm$)$ to answer the question:

Given a FA M accepting a language $L$ and a string $x,$ is $x$ a suffix of some string in L$?($i$.$e$.,$ does there exist a string $z$ such that $zx$ is in $L?)$