JAVA In this assignment, you will implement your own Dictionary-type data structure that stores a key/value pair in an array or vector. The backing array or vector must be strongly typed (use a generic or a template class). The key must be a string and the value stored may be any object type. In addition to the constructor, the data structure must utilize the methods shown below to store (set) and retrieve (get) data from the data structure. Hashing must be utilized to convert the key into an index for use in the array. Your design must provide a discussion on the hashing algorithm that will be utilized. A discussion must also be present on how collisions will be handled. The data structure will be used within a program that addresses the scenario defined below. Note that you may implement your data structure to address the solution below. public void set(string key, T value) public T get(string key)