Don't repeat the answer of other questions I will report you if you do that

I need the answer in hand written way and with explanation of why

2. (30 points) Let p be a prime number of length k bits. Let H(x)=x2 (mod p ) be a hash function which maps any message to a k-bit hash value. (a) Is this function pre-image resistant? Why? (b) Is this function second pre-image resistant? Why? (c) Is this function collision resistant? Why