Having trouble with the hash tables for programming. Need the sketches for questions 1, 2 and 3 please!

1. Sketch the result of building a separate chaining hash table from the following sequence of ey values. Use a table size o 624, 445, 187, 588, 281, 550, 495, 785, 63, 653, 282, 477, 191, 234, 345, 560, 272, 607 2. Repeat for a linear probing hash table and a table size of 20. 3. Sketch the linear probing hash table after the item with key value 445 has been removed