Imagine a scenario where H(z) is a hash function designed to be resistant to collisions, converting a message of any bit length into an n-bit hash output. Can we then conclude that for every pair of unique messages, such as p and q where p # q, the outputs H(p) and H(q) will also be unique? Please provide an explanation for this. (2 marks)