Hash Table of all Named Places Using the data file linked to in class 4's notes, http://rabbit.eng.miami.edu/class/een318/named-places.txt which can be accessed directly as a file on rabbit /home/www/class/een318/named-places.txt, Write a program that reads the entire file, creating a separate struct/class for each entry. The struct should contain separate members for the: + state abbreviation (string) + place name (string) + population (int) + area (float or double) + latitude (float or double) + longitude (float or double) + representative intersection (int) + distance to intersection (float or double) For THIS assignment, destructors are not expected and not recommended. Numeric values should be stored as the appropriate C++ types, not strings. Place names should be trimmed so that they have no spaces AT THE END. Store all of these objects in a Hash Table. The hash table must be structured to give fast search based on place name. (Notice that place names are not unique. For example, there is an Aberdeen in Idaho, Maryland, Missouri, North Carolina, Ohio, South Dakota, and Washington) After reading all the data, your program must interact with the user like this: Step 1: Invite the user to type a place name, Step 2: List all the states that contain a place with that name, Step 3: Invite the user to type one of those states, Step 4: Print all known information about the selected place. Detect user input errors, Be ready for names that contain spaces. Example run: This is just an illustration, you don't need to duplicate it exactly. Enter a place name: Aberdeen Select from ID, MD, MS, NC, OH, SD, WA: NC Aberdeen, NC Population 3400 Area 6.164109 Latitude 35.138494 N Longitude 79.427701 W Intersection 19565 Distance 0.6712 Enter a place name: Aberdeen Select from ID, MD, MS, NC, OH, SD, WA: PR There is no Aberdeen in PR Enter a place name: Trumptown No such place Enter a place name: New York Select from NY: NY Population 8008278 Area 303.310732 Latitude 40.704234 N Longitude 73.917927 W Intersection 6792 Distance 1.5444 Enter a place name: ^C