2. Assume you are given a cryptographic hash function that produces a 512-bits long hash output. Given some message m and its corresponding hash output h(m), what is the average probability that an attacker can find another message, m' not equal to m, that has the same hash output? In your computations, assume that attackers can make a maximum of 264 attempts