Let $m$ be a message and $h$ be a hash function. Which tasks must be hard for an adversary?

Select all that apply.

Given $h(m)$ for a rando $m,$ it must not be feasible to find $m$ such that $h(m)=h(m).$

Given $m$ and $h(m),$ it must not be feasible to find $m^{\text{'}}$ such that $h(m^{\text{'}})=h(m).$

It must not be feasible to find two different messages $m$ and $m^{\text{'}}$ such that $h(m)=h(m).$

It must not be feasible to compute $h(m).$