# complexity theory – Proof that a relation is in FP

How we can prove that the relation: $$R= left{0,1right}^*times left{0,1right}^* in FP$$
I understand that we need to find a polytime algorithm to decide whether $$(x,y) in R$$ since $$(x,y)in R= left{0,1right}^*times left{0,1right}^*$$
How can we find this? And this is enough to prove that $$R in FP$$?