Given a hash table with size 13. If only the positions with odd

Given a hash table with size 13. If only the positions with odd (奇数) indices are occupied (the index starts from 0), then when the quadratic probing is used, insertion of a new key into this hash table can be successful. ~@[](2)

答案：TRUE