A hash table of initial table capacity (array length) 5 is set up to store integers. The hash code is the integer itself, which is directly mapped to the table usinginteger mod table_capacity. Come up with the smallest dataset of distinct non-negative integers that can be inserted in the hash table, with the following conditions: (a) after inserting all the integers in the dataset, the average number ofcomparisons for successful search is strictly less than 2, and the worst case number of comparisons for successful search is 4, (b) the load factor threshold is 1.5, and (c) there must be exactly one rehash, when the threshold is exceeded. Assume that when an item is about to be inserted, the load factor is computed before actually inserting the item into the hash table. If rehashing is done, then the item is inserted after the rehash. Assume the rehash doubles the capacity of the table. Show the hash table entries just before the rehash, as well as thefinal hash table with all entries in it. The worst case and average caserequirements apply ONLY to the final hash table. What is the averagenumber of comparisons against the integers in the final hash table for successful search?