For this question, please consider the hash function and the collision resolution method specified for the formative programming exercise.

For $a=31,c=37$ and $m=50,$ what is the load factor of the hash table after calling the function insert $20$ times? In the $i-$th call, the value to insert is given by $2^{***}{i}^{**}i+3^{***}i-5.$ That is$,$ the first value to insert is $0,$ the second value is $9$ and so on$.$

Please, use a point as a decimal separator

For this question, please consider the hash function and the collision resolution method specified for the formative programming exercise. You might want to use your code to answer this question.

For $a=31,c=37$ and $m=50,$ numbers are inserted in the hash table in the following way: in the ith insertion, the value to insert is given by $2^{***}{i}^{***}i+5^{***}i-5.$ That is$,$ the first value to insert is $2,$ the second value is $13$ and so on$.$ What is the content of index position $0$ in the hash table after inserting $20$ numbers?

For this question, please consider the hash function and the collision resolution method specified for the formative programming exercise. You might want to use your code to answer this question.

For $a=31,c=37$ and $m=50,$ numbers are inserted in the hash table in the following way: In the ith insertion, the value to insert is given by $2^{***}{i}^{***}i+5^{**}i-5.$ That is$,$ the first value to insert is $2,$ the second value is $13$ and so on$.$ What is the index position where the first collision occurs?