Suppose we use double hashing to resolve collisons; that is, we use the hash function h(k;i) - (hi(k) + ih2(k)) (mod t). Show that if t is even and h2(k) is even for some key k, then the probe sequence for k examines at most half the slots in the table before returning to slot hi(k)