Data Structures (java) please fast

2) You are given an empty hash table of size 7 that uses open addressing. The following sequence of keys is to be inserted: Insert these keys using each of the following approaches. If overflow occurs, and indicate the element that causes the overflow. h(x)=x%7; linear probing h(x)=x%7; quadratic probing h(x)=x%7; double hashing with h2(x)=x/7+1 (using integer division)