Your objective is to implement your own Dictionary (aka a hash table). This table will only contain keys (no auxiliary/satellite data, commonly called "values"). You will use a simple String array as your keys following Create a public class called Dictionary that contains the following operations void insort (koyeris the specified key into the dictionary boolean delete (key) deletes the key from the dictionary and returns true. If key is not found, no deletion occurs and the function returns false. search (key) searches for the given key in the dictionary and returns the bucket index if found, 1 if not ound int String toString) Override to return a string representation of the dictionary. This should have vertical bars (aka "pipes") between keys and should use triple underscore for null buckets (refer to the sample output below) For insertion, you must use double hashing from the notes. For hashing use the following The prehash function will be Java's built-in hashCode() function. The primary hash function will use the simple division method . . The secondary hash function will use the one from the notes with c 3. Your objective is to implement your own Dictionary (aka a hash table). This table will only contain keys (no auxiliary/satellite data, commonly called "values"). You will use a simple String array as your keys following Create a public class called Dictionary that contains the following operations void insort (koyeris the specified key into the dictionary boolean delete (key) deletes the key from the dictionary and returns true. If key is not found, no deletion occurs and the function returns false. search (key) searches for the given key in the dictionary and returns the bucket index if found, 1 if not ound int String toString) Override to return a string representation of the dictionary. This should have vertical bars (aka "pipes") between keys and should use triple underscore for null buckets (refer to the sample output below) For insertion, you must use double hashing from the notes. For hashing use the following The prehash function will be Java's built-in hashCode() function. The primary hash function will use the simple division method . . The secondary hash function will use the one from the notes with c 3