$1.$ Given an initially empty hash table with capacity $11$ and hash function h $($x$)=$ x mod $11.$ Insert keys $0,1,8,9,52,44,56,53,61,64($in that order$).$

a$.$ Separate chaining

b$.$ Linear probing

c$.$ Quadratic probing

d$.$ Double hashing with h$($x$)=7($x mod $7)$