For a) and b) below, insert the following elements in this order: 70, 21,49,60, 59, 39. For each table, TableSize- 10, and you should use the primary hash function h(k)- k%10. If an item cannot be inserted into the table, please indicate this and continue inserting the remaining values. 8. b) Separate chaining hash table-use a inked list for each bucket where the values are ordered by increasing value Quadratic probing hash table tD a) What is the load factor in Table b)? b) What is the worst case running time of a find operation in table b