2 For the language L := {c, fl, 92, Rs } consisting of one constant, one unary function symbol, one binary function symbol, and one ternary relation symbol, define an L-structure on the set of 2-terms in a way such that the interpretation of a term t is not equal to t