Consider the implementation of a closed hash table a[0]..a[n-1] to store distinct positive integers, using quadratic probing to resolve collisions. A value of 0 indicates that a hash table location is currently unused. The hash function is h(x) = x % n . Write a function that searches the table for a given integer x. If found, the function returns the index of where x exists in the table. Return -1 if x is not found in the table. The average runtime of your routine should be according to the usual hashing standards.

Language preferred: C or C++