(c) Let $\mathcal{L}^*\subseteq\mathcal{L}^{\text{FOPC}}$ be a first order language of predicate calculus consisting of three unary function symbols $f,g,h$.
(i) Write down an $\mathcal{L}^*$-sentence $\phi$ such if $\mathcal{A}$ is an $\mathcal{L}^*$-structure with $\mathcal{A}\vDash\phi$ then the restriction of $h_\mathcal{A}$ to the range of $f_\mathcal{A}$ gives a one-to-one function onto the range of $g_\mathcal{A}$.
(ii) Write down an $\mathcal{L}^*$-sentence $\psi$ such that if $\mathcal{A}$ is an $\mathcal{L}^*$-structure with $\mathcal{A}\vDash\psi$ and the domain $A$ of $\mathcal{A}$ is finite then the cardinality $|A|$ is a square.
Part (i) is easy enough, but I'm having trouble with part (ii). I assume that you can use part (i). My initial idea was to use $h$ to ensure $|Range(f_A)| =|Range(g_A)|$ but I'm not sure where to go from there.
Thanks.
Think of $A$ as $F\times G$, where $|F|=|G|$, and think of $f$ and $g$ as being the projection maps from $A$ to $F$ and to $G$, respectively. That $|F|=|G|$ is, as you noted, captured by $\varphi$. For the rest, note that in this setting each element of $A$ is uniquely identified by the pair $\langle f_{\mathcal{A}}(a),g_{\mathcal{A}}(a)\rangle$: two different elements of $A$ cannot have the same pair of $f$ and $g$ values. Just turn this into an $\mathcal{L}^*$-sentence.