using c+++

Dictionary 340 C+, 35 points Our and uses the input as search are back to ask us to implement another interactive dictionary Our dictionary takes input from users ey to look up values associated with the key Requirements up values Coding No hard coding, httpsullen w Data Source: a text file, Data.CS.SFSU.xt Data Structure: Use existing data structurels) on peech, antng data structurels) or create new data structurets) to store our dictionary's data. Each keywond three parts in one String each definition must be stored in a separate data field. Do not combine them such as storing s opened once and closed once per run It must be closed as soon as possible. It must be am interface allows users to input search keys. This interface then displays returned results. Our ram's output must be identical to the complete sample run's output: ASMTOZ PC Run.pdtf structure. The data source file am starts, it loads all the original data from the data source into our dictionary's data once closed before our program starts interacting with users. User Interface: A program searches the Identical Output: Our program's output must be identical to the Identical Outpary's data (not the data source text file) for values associated with the search keys 1. Program Analysis to Program Design, 10 points data ( In 1 full page, please explain the following in detal provided information and the provided sample output. Compare to the ASMT 01 Java version you are solving, How it is different from that of ASMr 01. Your analysis of the 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 Program Implementation, 25 points 2. Does your program work properly? How will you improve your program? " Sample run (not the complete run): . Openioa date file Zate.CS.srsa.ca aestire To be updated.. Dictionary 340 C+, 35 points Our and uses the input as search are back to ask us to implement another interactive dictionary Our dictionary takes input from users ey to look up values associated with the key Requirements up values Coding No hard coding, httpsullen w Data Source: a text file, Data.CS.SFSU.xt Data Structure: Use existing data structurels) on peech, antng data structurels) or create new data structurets) to store our dictionary's data. Each keywond three parts in one String each definition must be stored in a separate data field. Do not combine them such as storing s opened once and closed once per run It must be closed as soon as possible. It must be am interface allows users to input search keys. This interface then displays returned results. Our ram's output must be identical to the complete sample run's output: ASMTOZ PC Run.pdtf structure. The data source file am starts, it loads all the original data from the data source into our dictionary's data once closed before our program starts interacting with users. User Interface: A program searches the Identical Output: Our program's output must be identical to the Identical Outpary's data (not the data source text file) for values associated with the search keys 1. Program Analysis to Program Design, 10 points data ( In 1 full page, please explain the following in detal provided information and the provided sample output. Compare to the ASMT 01 Java version you are solving, How it is different from that of ASMr 01. Your analysis of the 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 Program Implementation, 25 points 2. Does your program work properly? How will you improve your program? " Sample run (not the complete run): . Openioa date file Zate.CS.srsa.ca aestire To be updated