Part a)
We used the below web resource to convert the given message into its binary equivalent (ASCII).

https://www.branah.com/ascii-converter

Then we split the result into blocks of 16 bits as below:
0100010001101111
0010000001111001
0110111101110101
0010000001110111
0110000101101110
0111010000100000
0110110101100101
0010000001110100
0110111100100000
0111001101101001
0111010000100000
0110100101101110
0010000001100001
0010000001100011
0110111101110010
0110111001100101
0111001000100000
0110000101101110
0110010000100000
0111001001110101
0111001101110100
0010110000100000
0110111101110010
0010000001101010
0111010101110011
0111010000100000
0110011001100001
0110110001101100
0010000001100001
0111000001100001
0111001001110100
0010000001110111
0110100001100101
0111001001100101
0010000001001001
0010011101101101
0010000001110011
0111010001100001
0110111001100100
0110100101101110
0110011100111111

In the end we have XOR-ed the groups from above using the provided hashing algorithm and we have obtained 0100 0110 0101 0000, which corresponds to 4650 in hex.

•What is a hash value, and why do you think it is important? •Expl...