arr insert( )arr display()/display items int searchkey /search for item ifarr find(searchkeysystem out println("found searchkey)else system out println("can' find searchkey)arr delete( )arr delete( )arr delete( )/delete items arr display()/end main(/display items again /end class higharrayapp the higharray class is now wrapped around the array in main()we create an array of this class and carry out almost the same operations as in the lowarray java programwe insert itemssearch for an item--one that isn' there--and display the array contents because it' so easywe delete three items ( and instead of oneand finally display the contents again here' the output can' find notice how short and simple main(is the details that had to be handled by main(in lowarray java are now handled by higharray class methods in the higharray classthe find(method looks through the array for the item whose key value was passed to it as an argument it returns true or falsedepending on whether it finds the item or not the insert(method places new data item in the next available space in the array field called nelems keeps track of the number of array cells that are actually filled with data items the main(method no longer needs to worry about how many items are in the array the delete(method searches for the element whose key value was passed to it as an argumentand when it finds itshifts all the elements in higher index cells down one cellthus writing over the deleted valueit then decrements nelems we've also included display(methodwhich displays all the values stored in the array the user' life made easier in lowarray javathe code in main(to search for an item took eight linesin higharray javait takes only one the class userthe higharrayapp classneed not worry about index numbers or any other array details amazinglythe class user does not even need to know what kind of data structure the higharray class is using to store