in this programwe create an array called arrplace data items (kidsnumbersin itsearch for the item with value (the shortstoplouisa)display all the itemsremove the item with value (freddywho had dentist appointment)and then display the remaining items the output of the program looks like this found the data we're storing in this array is type long we use long to make it clearer that this is datatype int is used for index values we've chosen primitive type to simplify the coding generallythe items stored in data structure consist of several fieldsso they are represented by objects rather than primitive types we'll see such an example toward the end of this insertion inserting an item into the array is easywe use the normal array syntaxarr[ we also keep track of how many items we've inserted into the array with the nelems variable searching the searchkey variable holds the value we're looking for to search for an itemwe step through the arraycomparing searchkey with each element if the loop variable reaches the last occupied cell with no match being foundthe value isn' in the array appropriate messages are displayedfound or can' find deletion deletion begins with search for the specified item for simplicitywe assume (perhaps rashlythat the item is present when we find itwe move all the items with higher index values down one element to fill in the "holeleft by the deleted elementand we decrement nelems in real programwe would also take appropriate action if the item to be deleted could not be found display displaying all the elements is straightforwardwe step through the arrayaccessing each one with arr[jand displaying it program organization the organization of array java leaves something to be desired the program has only one classarrayappand this class has only one methodmain(array java is essentially an old-fashioned procedural program let' see if we can make it easier to understand (among other benefitsby making it more object oriented