How to di these questions? please also give the explanation, ty!

What are the 'expected running time of insertion' and 'worst case running time of deletion', in a hash table with quadratic probing to resolve collisions? a) 0(log n) and 0( ) b) O(1) and O(n) c) O(Vi) and O(Vi) d) 0(v ) and O(n) Using alphabet position, encode 'science' with the following hash map p (z) = ao + a1 z + a2 z2 + + an-1 Zn-1 with Z=19