Suppose we have a hash function h(k) = k%7. Given the ordered input {35, 40, 21, 33, 26}, show the resulting:

a) separate chaining hash table:

b) hash table using quadratic probing using the function f(i)=i²

c) hash table using double hashing using a second hash function h'(k) = 5 - (k%5):

note: hash table size was not specified in question.