(computer network security)

Consider a hash function Z that has the following steps:

1) Divide the data block into bytes.

2) For each byte produce a hash value (one bit) that equals the XOR of all the bits of the byte segment.

(ex: the hash value of 10101010= 1 XOR 0 XOR 1 XOR 0 XOR 1 XOR 0 XOR 1 XOR 0 = 0)

a) Using the hash function Z calculate the hash value of the data block CA 47.

b) Find another data block that has the same hash value obtained in (a).

c) Does the hash function Z fulfill the requirements of preimage resistant, second preimage resistant, and collision-r resistant? Justify your answer.