"hash functions for block ciphers

$$ Block size $=8$ bit VH$18$ s

$$ Hash size $=8$ bits

$$ Encryption function: Divide the key into two halves: LK and RK; Divide the plaintext into two halves: LT and RT; Then ciphertext$=$ LC$||$RC where LC$=$LK XOR RT; and RC $=$ RK XOR LT; where LC$,$ RC$,$ LT$,$ and RT are each $4$ bits; Plaintext and ciphertext are each $8$ bits.

$$ g$($H$)=$ an $8-$bit string that is equal to the complement of bits in H; For example, if H$=$A$3($Hexa$)=10100011($binary$)$; then g$($H$)=01011100$

$$ H$0=$ Initial hash $=11001010$

Given a message m: AB$12($in Hexa$)$;

$1.$ Determine the hash $($in hexadecimal$)$ of the message M using Matyas$-$Meyer$-$Oseas hash function

$2.$ Determine the hash $($in hexadecimal$)$ of the message M using Davis$-$Meyer hash function

$3.$ Determine the hash $($in hexadecimal$)$ of the message M using Migayuchi$-$Preneel hash function"