Generаlly, а functiоn with а оne-byte оutput would not be a secure hash function. Let's assume that HASH() is used to construct a Merkle tree and only has one byte for an output. Given the HASH() outputs below, what would be the Merkle root of a Merkle tree with four items, item1, item2, item3, and item4 in that order? Use a binary tree structure. Also, we use | to mean concatenations. All outputs are one byte written in hex. Use the information below to help answer the question. Your answer is one of the hashes below (hashes are on the right side of the equal sign in the equations below). HASH(item1) = 5B HASH(item2)=67 HASH(item3)=89 HASH(item4)=A2 HASH(item1|item2)=5F HASH(item3|item4)=E2 HASH(5B|67)=C3 HASH(89|A2)=D5 HASH(5F|E2)=D3 HASH(C3|D5)=12