In this problem, you will examine why techniques that work nicely for error correction codes are not suited as cryptographic hash functions. You will look at a hash function that computes an $8-$ bit hash value by applying the following equation: Ci $=$ bi$1+$ bi$2+$ bi$3+$ bi$4+$ bi$5+$ bi$6+$ bi$7+$ bi$8$ Every block of $8$ bits constitutes an ASCII encoded character. a$.$ Encode the string CIPHER to its binary or hexadecimal representation. b$.$ Calculate the $(6-$bit long$)$ hash value of the character string using the previously defined equation. c$.$Break$$ the hash function by pointing out how it is possible to find $($meaningful$)$ character strings which result in the same hash value. Provide an appropriate example showing your work; that is$,$ show how your string$$s hash matches that of CIPHER. d$.$ Which crucial property of hash functions is missing in this case?