Consider the opposite problem: using an encryption algorithm to construct a one way hash function, consider using RSA with a known key. Then process a message consisting of a sequence of blocks as follows: Encrypt the first block, XOR the result with the second block and encrypt again, etc. Show that this scheme is not secure by solving the following problem. Given a two$-$block message B$1,$ B$2,$ and its hash

RSAH$(B_1,B_2)=$RSA$(RSA(B1)o+B2)$

Given an arbitrary block $Cl,$ choose $C2$ so that $.$Thus, the hash function does not satisfy weak collision resistance. RSAH$(Cl,C2)=$RSAH$(B1,B2)$