Problem 3. Fill in the blanks regarding the state of a chaining hash table with hash function h(x) = (x + 3) mod 8 and an array of length 8 after the following operations HashTable H; H.insert(19, 19); H.insert(3, 3); H.insert(9, 9); H.insert(5, 5); H.insert(1, 1); H.insert(10, 10); H.insert(11, 11); H.insert(17, 17); H.erase (3); H.erase (4); H.erase (5); The size of the linked list at index 4 is number The size of the linked list at index 6 is number The size of the shortest linked list in H is number The size of the longest linked list in H is number