The Unification Algorithm for two Terms

We will work with the following language of algebras.
(The constant symbol has arity 0).
SymbolArity
c 0
f 1
g 2
h 3

Choose two terms (in prefix form) that the unification algorithm is to be applied to:

s =
t =