Let both $f$:$\{0,1{\}}^{**}\{0,1{\}}^m$ and $g$:$\{0,1{\}}^{**}\{0,1{\}}^m$ be cryptographic hash functions. Let $h=fo+g,$ that is$,$ each string $h(x)$ is obtained from the strings $f(x)$ and $g(x)$ by bitwise addition modulo $2.$ Is $h$ also a cryptographic hash function? Explain your answer.