arrays in an array holding an even number of data itemsthere is no middle item which item does the binary search algorithm examine firstuse the ordered workshop applet to find out programming projects writing programs to solve the programming projects helps to solidify your understanding of the material and demonstrates how the concepts are applied (as noted in the introductionqualified instructors may obtain completed solutions to the programming projects on the publisher' web site to the higharray class in the higharray java program (listing )add method called getmax(that returns the value of the highest key in the arrayor - if the array is empty add some code in main(to exercise this method you can assume all the keys are positive numbers modify the method in programming project so that the item with the highest key is not only returned by the methodbut also removed from the array call the method removemax( the removemax(method in programming project suggests way to sort the contents of an array by key value implement sorting scheme that does not require modifying the higharray classbut only the code in main(you'll need second arraywhich will end up inversely sorted (this scheme is rather crude variant of the selection sort in "simple sorting " modify the orderedarray java program (listing so that the insert(and delete(routinesas well as find()use binary searchas suggested in the text add merge(method to the ordarray class in the orderedarray java program (listing so that you can merge two ordered source arrays into an ordered destination array write code in main(that inserts some random numbers into the two source arraysinvokes merge()and displays the contents of the resulting destination array the source arrays may hold different numbers of data items in your algorithm you will need to compare the keys of the source arrayspicking the smallest one to copy to the destination you'll also need to handle the situation when one source array exhausts its contents before the other write nodups(method for the higharray class of the higharray java program (listing this method should remove all duplicates from the array that isif three items with the key appear in the arraynodups(should remove two of them don' worry about maintaining the order of the items one approach is to first compare every item with all the other items and overwrite any duplicates with null (or distinctive value that isn' used for real keysthen remove all the nulls of coursethe array size will be reduced