Consider the first construction of a hash function using a block cipher:hi$=$Emi$($h$0)$ and h$0$ is a fixed hash string, mi are partitioned plaintexts and hi is the steps of the hash function. Two different keys k$1$ and k$2$ of the underlying block cipher are

said to be equivalent if Ek$1($x$)=$ Ek$2($x$)$ for any message x$.$ Is it possible to find a strong

collision of the hash function if the underlying block cipher has known equivalent keys?

Justify your answer.