create a Merkle Tree below for the following transactions: A, B, C, D, E, F, G - . Be sure to show the entire tree from the transaction level and all leaf/hash levels until you are at the root! and  Explain how this process of Merkle trees helps secure Bitcoin, etc.

Using quadratic probing, what would be the answer for the following questions if you insert the following keys in sequence: 10, 17, 24, 31, 21, 19. (N = 7) While doing the insertions  keep track of the number of collisions for each key and get the final configuration of the structure.  Use the following quadratic hashing function: ((x mod 7) + j²) mod 7. What is the final configuration of the hash table? Use the indices from 0 to 6 to report where each key will be mapped. If the position has no value use the word empty. For example, if the final configuration is 10,17,24,31,21,19 (starting from index 0), your answer in the box should be 10,17,24,31,21,19,empty. Please don't use blank spaces or quotes to separate the values.          Report the number of collisions for each key using the order of insertion. For example, if you answer as 0,1,3,1,0,1, this means that you found 0 collisions for key 3, 1 collision for key 10, 3 collisions for key 17, 1 collision for key 24, 0 collisions…

Choose one method of collision resolution and briefly explain how it works.  Since collisions are due to hashing, make sure you mention the role hashing plays in collisions.  Be specific about what hashing is and what its role is.

Outline how various hash algorithms, such as SHA-2 and SHA-3, ensure data integrity during transmission.