1. Implement the data structure hash-table in a class HashTable. Keep the data in an array of key-value pairs (KeyValuePair[]) with initial capacity of
2. Resole the collisions with quadratic probing. When the hash table load runs over 75%, perform resizing to 2 times larger capacity. Implement the following methods and properties: Add(key, value), Find(key) → value, Remove(key), Count, Clear(), this[] and Keys. Try to make the hash-table to support iterating over its elements with foreach.