Suppose the original attempt to insert an element into a hash table of size 11 fails, where the initial hash function computation, h(k), is 9 (i.e. h(k) = 9). In an attempt to resolve collision using...

Suppose the original attemptto insert an element into a hash table of size 11 fails, where the initial hash function computation, h(k), is 9 (i.e. h(k) = 9). In an attempt to resolve collision using quadratic probing. the first probe point also fails. What alternative index location will then be considered for the next possible insertion?