In double hashing, $$ i$)$ k$)+$ ih$2($k$))$ mod m$.$ Prove or

disprove th if h$2($k$)$ is relatively prime to m and h$2($k$)$ is not equal to $0,$

then the probe sequence is a permutation of $\{1,2,...,$ m$-1\}.$