Create a simple C# Program. You are going to implement your own (rudimentary) hash table using an array. Your hash table will store a series of strings, these words should be hashed and then stored in the array based on their index, the index being the result of the hash function. Your hash function should count the number of letters in the string (obviously a terrible hash function). After reading in the string (hard coded in the source code is fine) and populating the hash table you should be able to search the table as efficiently as possible to see if something is present. Use quadratic probing, assume 15 inputs, an array of maximum size 50. Hard code your inputs.