 Solution

Let total computable $f$ and $g$ witness $X{\le }_{m}Z$ and $Y{\le }_{m}Z$. DefineParity testing and integer division by two are computable, so $h$ is total computable. For every $m$,Therefore $X\oplus Y{\le }_{m}Z$.