3. (1) Define a toy hash function h: (Za) are modulo 2 and (Za) by the rule by h(x)-xA where all operations 1 0 0 0 A 1 1 1 1 0001/ Find all preimages of (0,1,0,1). (2) Suppose thatf: (0,1)- 50,1)m is a preimage resistant bijection. Define h0m- 10,1)m as follows. Given x e{0,132m, write x-xr", where x', x"E10,1). Then define h(x)-f(x'XOR x"). Prove that h is not second preimage resistant