For a cryptographic hash function, we require it to be preimage resistant $($one$-$way$),$ weak collision resistant $(2$nd preimage resistant$),$ and strong collision resistant. Which requirement is analogous to finding a group of students sharing the same birthday in a class?