I'm trying to prove that FSAT is FNP-complete and I could use a few hints.

This is what I've gotten so far:

Everything except for the last paragraph are just definitions almost word for word from our coursebook (Computational Complexity, Papadimitriou). What I'm having trouble with is the second point ie proving that there is a string function S for every language in FNP.