Need help with these 3 questions.

The following table represents a hash table using linear probing using a modular division hash code based upon the size of the array 7. Where would the following value be placed into the hash table? Add: 20 29 18 13 0 1 N 3 3 4 5 6 2 0 5 5 6 What is the maximum number of comparison it would take to find an item using a binary search with a list size of 100? 1 100 7 7 25 Given a hashtable size 499, what is the maximum number of elements that can be placed using linear probing or chaining? Using Linear Probing: 499 - Using Chaining: 998 Using Linear Probing: no max value - Using Chaining: 499 Using Linear Probing: 499 - Using Chaining: no max value Using Linear Probing: 998 - Using Chaining: 499