1. Consider a hash function h(x) = (2x% m) where m = 7. Using (2x2 + 3j) % m as collision resolution function insert the following numbers into a hash table of size m. 46,33, 11,7,8,9 Make sure to illustrate all your intermediate steps. Failure to do so may result in award of zero marks. 2. Let x = last two digits of your registration number, and y = (x % 9) + 4 Insert the following numbers in an empty binary tree and show all intermediate steps. 3y, 4y. 2y, 4y +6, +8, y + 10, 4y - 2, 2y - 10, 2y 5, y. Make sure to illustrate all your intermediate steps. Failure to do so may result in award of zero marks. 3. Can you design a perfect hashing function - a hash function that will result in zero collision? Justify your answer with valid arguments? 4. Write a function to find all prime numbers in a linked list? 1. Consider a hash function h(x) = (2x% m) where m = 7. Using (2x2 + 3j) % m as collision resolution function insert the following numbers into a hash table of size m. 46,33, 11,7,8,9 Make sure to illustrate all your intermediate steps. Failure to do so may result in award of zero marks. 2. Let x = last two digits of your registration number, and y = (x % 9) + 4 Insert the following numbers in an empty binary tree and show all intermediate steps. 3y, 4y. 2y, 4y +6, +8, y + 10, 4y - 2, 2y - 10, 2y 5, y. Make sure to illustrate all your intermediate steps. Failure to do so may result in award of zero marks. 3. Can you design a perfect hashing function - a hash function that will result in zero collision? Justify your answer with valid arguments? 4. Write a function to find all prime numbers in a linked list