This question is about collision resolution using the quadratic probing method that we discussed in the class

Consider the following hash table which contains integer keys and uses the following quadratic probing method:

$h(k)=k+f(i),$modN

where

$f(i)=i+i^2$

$N$ is the size of the hash table

$i$ is the probe count $($starting at $0)$

If you were to insert the key: $k=40,$ at what index will the key be placed?

a$.5$

b$.1$

c$.6$

d$.7$