Question

Choose the correct option(s): Modifying a leaf node in a Merkle tree will result in O(k) changes to a table of depth k A Merkle tree to store 1024 unique elements will have a total of 211-1 nodes The maximum number of hashes to be computed to verify proof for a Merkle tree of 1024 elements is 11. None of the given options

Answer 1

Answer:

none of the these

Explanation: