Say you have a relation with $2,000$ records. You want to hash the relation

into a static hash table with $100$ buckets $($i$.$e$.$ hash table size $=100).$ A disk block can

store at most $10$ records $($along with an optional pointer to an overflow block$).$

Assume that a disk block cannot store records from two different buckets.

a$)$ What is the minimum number of disk blocks you would need for the relation?

Please explain your answer.

b$)$ What is the maximum number of disk blocks you would need for the relation?

Please explain your answer.