hash tables initiallythe program asks the user to input the size of the hash table and the number of items in it you can make it almost any sizefrom few items to , (building larger tables than this may take little time don' use the (for showoption on tables of more than few hundred itemsthey scroll off the screen and displaying them takes long time variable in main()keyspercellspecifies the ratio of the range of keys to the size of the array in the listingit' set to this means that if you specify table size of the keys will range from to if you want to see what' going onit' best to create tables with fewer than about items so that all the items can be displayed on one line here' some sample interaction with hash javaenter size of hash table enter initial number of items enter first letter of showinsertdeleteor finds table ** * * enter first letter of showinsertdeleteor findf enter key value to find found enter first letter of showinsertdeleteor findi enter key value to insert enter first letter of showinsertdeleteor finds table * * * enter first letter of showinsertdeleteor findd enter key value to delete enter first letter of showinsertdeleteor finds table *- * * key values run from to ( times minus the *symbol indicates that cell is empty the item with key is inserted at location (the first item is numbered because % is notice how changes to - when this item is deleted expanding the array one option when hash table becomes too full is to expand its array in javaarrays have fixed size and can' be expanded your program must create newlarger arrayand then insert the contents of the old small array into the new large one