Implement MyMap using open addressing with linear probing Create a new concrete class that implements MyMap using open addressing with linear probing. For simplicity, use $f(key)=$ key $\%$ size as the hash function, where size is the hash$-$table size. Initially, the hash$-$table size is $4.$ The table size is doubled whenever the load factor exceeds the threshold $(0\mathrm{.}5).$

Implement MyMap using open addressing with quadratic probing $-$ Create a new concrete class that implements MyMap using open addressing with quadratic probing. For simplicity, use $f(key)=(key+j^2)\%$ size as the hash function, where size is the hash$-$table size and j $>=0.$ Initially, the hash$-$table size is $4.$ The table size is doubled whenever the load factor exceeds the threshold $(0\mathrm{.}5).$

Implement MyMap using open addressing with double hashing Create a new concrete class that implements MyMap using open addressing with double hashing. For simplicity, use key