I'm not sure how to solve this problem. Can I get your help?

Let F denote the set of all functions from N to N , that is, F = {f N N | f is a function }.

Define a relation R on F by the rule (f, g) R iff for every nN we have f (n)g(n). Prove that

R is a partial order on F.