implicit in the deletion algorithm is the assumption that holes are not allowed in the array hole is one or more empty cells that have filled cells above them (at higher index numbersif holes are allowedall the algorithms become more complicated because they must check to see whether cell is empty before examining its contents alsothe algorithms become less efficient because they must waste time looking at unoccupied cells for these reasonsoccupied cells must be arranged contiguouslyno holes allowed thereforeafter locating the specified item and deleting itthe applet must shift the contents of each subsequent cell down one space to fill in the hole figure shows an example item to be deleted figure contents shifted down deleting an item if the item in cell ( in figure is deletedthe item in shifts into the item in shifts into and so on to the last occupied cell during the deletion processwhen the item is locatedthe applet shifts down the contents of the higher-indexed cells as you continue to press the del button deletion requires (assuming no duplicates are allowedsearching through an average of / elements and then moving the remaining elements (an average of / movesto fill up the resulting hole this is steps in all the duplicates issue when you design data storage structureyou need to decide whether items with duplicate keys will be allowed if you're working with personnel file and the key is an employee numberduplicates don' make much sensethere' no point in assigning the same number to two employees on the other handif the key value is last namesthen there' distinct possibility several employees will have the same key valueso duplicates should be allowed