Let us take a hash function $h(x)=x$ mod $10$ and an input $\{2451,1223,5833,8729,5434,1289,5329\}.$

$($a$)$ Construct the chaining hash table

$($b$)$ Construct the hash table with linear probing

$($c$)$ Construct the hash table with quadratic probing

Please show each step in each part. Do not just give final result.