Consider a hash function collision resistant or strong collision resistant if it is computationally infeasible to find two different inputs x 1 ≠ x 2 with h(x 1 ) = h(x 2 ).In a communication between...

Consider a hash function collision resistant or strong collision resistant if it is computationally infeasible to find two different inputs x¹ ≠ x² with h(x¹) = h(x²).In a communication between Alice and Bob, Find out how Oscar an attacker could turn his ability to find collisions into an attack by altering 2 input messages, x¹and x² . Provide a diagram to support your answer.