Hello. Please answer the attached Data Structures question correctly and follow all directions. Create a proof for this problem. *If you answer correctly, I will provide a thumbs up. Thank you. 1. A certain university assigns each of its students student numbers the first time they register for any course. These numbers are sequential integers that started at 0 many years ago and are now in the millions. Suppose we have a class of one hundred first year students and we want to assign them hash codes based on their student numbers. Does it make more sense to use the first two digits or the last two digits of their student number? Justify your answer. Hint: compute the size of each set.

Given: 1.- A certain university assigns each of its students student numbers the first time they register for any course. These numbers are sequential integers that started at O many years ago and are now in the millions. Suppose we have a class of one hundred first year students and we want to assign them hash codes based on their student numbers. Does it make more sense to use the first two digits or the last two digits of their student number? Justify your answer. Hint: compute the size of each set.No, it does not make sense to assign hash codes based on first 2 or last 2 digits of their student numbers. Because 2 students in the same class can have student numbers like: (198 and 298) or (192 and 199). In this case, we won't be able to distinguish between them. Suppose the integers are 1111 and 0000. On applying xor, the hash would be 1111Suppose the integers are 1010 and 0101. On applying xor, the hash would be 1111, which is the same as previous case