in python
4. (10 points) Write a function that receives a hash table H that solves collision with chaining and an integer k and returns the largest element in the table that has the same hash value as k, or -1 if no element in H has the same hash value as k 15. (8 points) Consider the following code fragment. Show the configuration of the heap after the code is executed А (60, 70, 40,
OR
PayPal Gateway not configured
OR
PayPal Gateway not configured