(b) [1696] For each of the following hash function, prove or disprove if the resulting sequence of probes is always a permutation of (0, 1, ..., m- 1j, where h'(k)-k mod m and m- 2P for some positive integer p. (i) h(k, i (h'(k) + 3i) mod m. (ii) h(k, i)-(N(k) + + P)) mod m. (b) [1696] For each of the following hash function, prove or disprove if the resulting sequence of probes is always a permutation of (0, 1, ..., m- 1j, where h'(k)-k mod m and m- 2P for some positive integer p. (i) h(k, i (h'(k) + 3i) mod m. (ii) h(k, i)-(N(k) + + P)) mod m