1. Yes.  It must visit all slots.  If h(x) is odd, the probe sequence will visit all the odds to the end of the hashtable, then all of the evens, then all of the odds from the beginning of the hash table up to the entry before h(x).  If h(x) is even, the probe sequence will visit all of the events to the end of the hashtable, then all of the odds, then all of the evens at the beginning of the table up to the entry before h(x).

Note that during any given search, it will only follow the probe sequence until it either finds the value or until it finds an empty entry.

2.

0: 9
1: 8
2: 18
3:
4: 4
5:
6: 11
7:
8: 17