suppose we have some high scores that we want to store in an array named entries the number of scores we want to store could be or so let us use symbolic namemaxentrieswhich represents the number of scores we want to store we must set this variable to specific valueof coursebut by using this variable throughout our codewe can make it easy to change its value later if we need to we can then define the arrayentriesto be an array of length maxentries initiallythis array stores only nullentriesbut as users play our video gamewe will fill in the entries array with entriesbut as users play our video gamewe will fill in the entries array with references to new gameentry objects so we will eventually have to define methods for updating the gameentry references in the entries array the way we keep the entries array organized is simple--we store our set of gameentry objects ordered by their integer score valueshighest to lowest if the number of gameentry objects is less than maxentriesthen we let the end of the entries array store null references this approach prevents having any empty cellsor "holes,in the continuous series of cells of array entries that store the game entries from index onward we illustrate an instance of the data structure in figure and we give java code for such data structure in code fragment in an exercise ( - )we explore how game entry addition might be simplified for the case when we don' need to preserve relative orders