You will create drawing(s) to demonstrate insertion To present this effectively, show insertion of the contents of a file containing no more than 8 tokens, unordered into a 5 element array of struct. Given that the array can be partially filled, show the process that will be carried out to insert tokens, where at least two appear multiple times. Show the array initially, this includes the array and its in-use counter. Then, show the progression of inserting each token, including the value returned by the search used by the insertion routine, until the file has been processed. Your drawing must show an instance of each of the cases for the value returned by the search, marked clearly and demonstrating what must be done visually and with a text description. It must be neat, with clear labeling of the cases and all actions. The sample data file should be displayed as well. Shoddy/incomplete drawings will receive commensurate grades or not be accepted. No program will be graded without an acceptable drawing having been submitted first. los function will Notes: Dkeyword A word, or token, is whatever is read using the >> operator. A word followed by a period is distinct from the same word without the period. Words are also case sensitive, i.e. heLLO Hello. > When a word is placed into the array of struct, its counter is initially 1. The purpose of creating drawings is to understand the problem completely before doing any coding. DO NOT write any code until your drawings are complete and you fully understand how all cases are handled. When the array reaches capacity, only repeats will be tabulated. New tokens will be discarded; meaning only one result of the search function will result in updating anything in the array once it becomes full. 1. While several functions are required, other functions should be written as well. One such function will handle Case 3 for the value returned by the search. o To keep the array sorted, only one method is permitted: shift all elements greater than the new token one element to the right to create an open slot for the new data. Set up turnin now. You will not be permitted to submit late because your turnin wasn't set up or tested. Work incrementally. Your success in this course and our program may well depend upon your learning and practicing this concept. After completing each part of the project, test it before continuing to the next part. Under no circumstances should you try to write the entire project without testing as you go. Identify the basics and complete those first. TEST YOUR PROJECT on acad (csit) BEFORE submitting! Strategies will be discussed. Your program must be well written, properly indented, and commented, including an id block. The instructor's website has detailed information on proper documentation. Deliverables: On the respective due dates: The drawing(s), well labeled, in a doc, pdf, jpeg, or tif.. . The program, named precisely pl.cpp, all lower case. 2-point penalty for non-compliance to these directions. You will create drawing(s) to demonstrate insertion To present this effectively, show insertion of the contents of a file containing no more than 8 tokens, unordered into a 5 element array of struct. Given that the array can be partially filled, show the process that will be carried out to insert tokens, where at least two appear multiple times. Show the array initially, this includes the array and its in-use counter. Then, show the progression of inserting each token, including the value returned by the search used by the insertion routine, until the file has been processed. Your drawing must show an instance of each of the cases for the value returned by the search, marked clearly and demonstrating what must be done visually and with a text description. It must be neat, with clear labeling of the cases and all actions. The sample data file should be displayed as well. Shoddy/incomplete drawings will receive commensurate grades or not be accepted. No program will be graded without an acceptable drawing having been submitted first. los function will Notes: Dkeyword A word, or token, is whatever is read using the >> operator. A word followed by a period is distinct from the same word without the period. Words are also case sensitive, i.e. heLLO Hello. > When a word is placed into the array of struct, its counter is initially 1. The purpose of creating drawings is to understand the problem completely before doing any coding. DO NOT write any code until your drawings are complete and you fully understand how all cases are handled. When the array reaches capacity, only repeats will be tabulated. New tokens will be discarded; meaning only one result of the search function will result in updating anything in the array once it becomes full. 1. While several functions are required, other functions should be written as well. One such function will handle Case 3 for the value returned by the search. o To keep the array sorted, only one method is permitted: shift all elements greater than the new token one element to the right to create an open slot for the new data. Set up turnin now. You will not be permitted to submit late because your turnin wasn't set up or tested. Work incrementally. Your success in this course and our program may well depend upon your learning and practicing this concept. After completing each part of the project, test it before continuing to the next part. Under no circumstances should you try to write the entire project without testing as you go. Identify the basics and complete those first. TEST YOUR PROJECT on acad (csit) BEFORE submitting! Strategies will be discussed. Your program must be well written, properly indented, and commented, including an id block. The instructor's website has detailed information on proper documentation. Deliverables: On the respective due dates: The drawing(s), well labeled, in a doc, pdf, jpeg, or tif.. . The program, named precisely pl.cpp, all lower case. 2-point penalty for non-compliance to these directions