If 7 elements have been stored in a hash table which is represen

If 7 elements have been stored in a hash table which is represented by an array of size 13, the hash function is $$H(x)=x\%13$$, and quadratic probing is used, then an empty spot can always be found when inserting a new element. ~@[](2)

答案：FALSE