I understand how to build both hash tables, I just dont know how to complete the amount of key comparisons with the longest possible failed search for both. Please help. Thank you

E. Suppose you want to build a hash table of items whose keys are strings of letters. Let the slots be numbered 0 through 6, and let the hash function consist of taking the sum of the letters mod 7 (where a=1, b=2, c=3, etc.). For example, "dog" hashes to (4 + 15 + 7) mod 7, that is, 5. Suppose your table contains the items "dog", "bug", "ant", "bee", and "gnu". (20 points) (a) If you use linear probing to resolve collisions, what does the table look like? How many key comparisons will the longest possible failed search require? (b) If you use chaining to resolve collisions, what does the table look like? How many key comparisons will the longest possible failed search require