Define the double_hash_probe_count() function which is passed two parameters:

1. a new key to insert into the hashtable
2. the current hashtable represented as a Python list (where the value None represents an available slot)

The function inserts the value into the Python list using the double hashing technique to resolve key collisions. The function returns the total number of probes performed in finding an available slot for the key.

The hash function used is:

h(key) = key % table_size 

The function uses double hashing for resolving collisions and the second hash function is:

h'(key) = 5 - (key % 5)

For example:

Test	Result
values = [88, None, 35, 25, 10, None, None, None, None, None, 32] probes = double_hash_probe_count(11, values) print('Table =', values) print('Probes =', probes)	Table = [88, None, 35, 25, 10, None, None, None, 11, None, 32] Probes = 3
values = [None, 11, 2, 3, 4, None, 18] probes = double_hash_probe_count(9, values) print('Table =', values) print('Probes =', probes)	Table = [None, 11, 2, 3, 4, 9, 18] Probes = 4