You are provided with the ds$\_$hash hash function. The function receives a

finite message as input and produces a non$-$negative integer, which we

consider to be the hash value of the given message.

The size of input messages is fixed and always equals $64$ bytes. Implement an

appropriate attack to check if the hash function ds$\_$hash is strong collision

resistant. Your alphabet should include all lower$-$case and upper$-$case letters

of the English alphabet and all numbers from $0$ to $9.$

# $--$ START OF YOUR CODERUNNER SUBMISSION CODE

# INCLUDE ALL YOUR IMPORTS HERE

def ds$\_$hash$($message: str$)->$ int:

hash$\_$value $=0$

for ch in message:

hash$\_$value $=($hash$\_$value $*71)+$ ord$($ch$)$

return hash$\_$value & $0$x$7$FFFFFFF

def myAttack$()->$ bool:

# YOUR IMPLEMENTATION

return # True or False

# $--$ END OF YOUR CODERUNNER SUBMISSION CODE

#You can test your code in your system $($NOT IN YOUR CODERUNNER SUBMISSION$)$

as follows:

# MAIN

if $\_\_$name$\_\_=="\_\_$main$\_\_"$:

print$($ myAttack$())$