Which one of the following is correct regarding a cryptographic hash function? Select one: a. There is no randomness in the algorithm of a cryptographic hash function. b. A strong cryptographic hash function creates a unique ID for each input due to collision resistance property. c. A single bit change in the input of a cryptographically strong hash function results in exactly half of the bits in its output to be changed in what is known as the "avalanche" effect. d. A strong cryptographic hash function can only be decrypted efficiently by the intended recipient. e. All the rest are wrong. f. Cryptographic hash functions provide data origin authentication. g. A hash function may fail the second pre-image resistance test but can still be collision-resistant