Suppose that L is the first order language that only contains a single unary function symbol f. Consider the following three structures: (1) M = (N, fm) where fM(n) = n + 1 for all n E N, (2) P = (R, fp) where fp(t) = t2 for all t R (3) o = (z, fo) where fo(m) = m + 1 for all rn E Z. Find, for each structure, a sentence p which is satisfied by that structure and not satisfied by the other two structures. Suppose that L is the first order language that only contains a single unary function symbol f. Consider the following three structures: (1) M = (N, fm) where fM(n) = n + 1 for all n E N, (2) P = (R, fp) where fp(t) = t2 for all t R (3) o = (z, fo) where fo(m) = m + 1 for all rn E Z. Find, for each structure, a sentence p which is satisfied by that structure and not satisfied by the other two structures