Our satisfied clients are back to ask us to implement another interactive dictionary. Our dictionary takes input from users and uses the input as search key to look up values associated with the key.

Our satisfied clients are back to ask us to implement another interactive dictionary. Our dictionary takes input from users and uses the input as search key to look up values associated with the key. Requirements: 

• -  Coding: No hard coding, https://en.wikipedia.org/wiki/Hard_coding .  
• -  Data Source: a text file, Data.CS.SFSU.txt  
• -  Data Loading: When our program starts, it loads all the original data from the data source into our dictionary’s data structure. The data source file is opened once and closed once per run. It must be closed as soon as possible. It must be closed before our program starts interacting with users.  
• -  Data Structure: Use existing data structure(s) or create new data structure(s) to store our dictionary’s data. Each keyword, each part of speech, and each definition must be stored in a separate data field. Do not combine them such as storing three parts in one String.  
• -  User Interface: A program interface allows users to input search keys. This interface then displays returned results. Our program searches the dictionary’s data (not the data source text file) for values associated with the search keys.  
• -  Identical Output: Our program’s output must be identical to the complete sample run’s output: ASMT02_PC_Run.pdf  
  1. Program Analysis to Program Design, 10 points In 1 full page, please explain the following in detail: ▪ Your analysis of the provided information and the provided sample output. Compare to the ASMT 01 Java version. ▪ What problem you are solving. How it is different from that of ASMT 01. ▪ How you load data from the data source. What the steps are. Why these steps. ▪ Which data structure(s) you use/create for your dictionary. And why.  
  2. Program Implementation, 25 points ▪ Does your program work properly? ▪ How will you improve your program? ▪ Sample run (not the complete run):