Using Java, I need to create a hash table to alphebetically sorta text file of names called “names.txt” and it needs to have acollision management scheme to preserve the ordering of the hashtable. The program needs to be able to run with 3 different sizesof hash table: 200, 400, and 700. The number of collisions thatoccur for each size table need to be recorded, also any collisionsthat occur after the previous collision. Finally, the program needsto print out the contents of the table for each different size hashtable. The names in the text file are as follows:
joe
bob
harry
mary
brian
tom
jerry
bullwinkle
pam
ellis
dale
bill
barrack
george
gertrude
zack
zeus
apollo
gemini
greg
larry
meriam
webster
thomas
stewart
dianna
theresa
billyjoe
carl
karl
charles
karla
donna
tena
kerry
howard
johnson
ulyssess
paul
peter
issaac
marvin
dudz
chuck
ellie
anny
judy
matt
ross
dan
robert
kim
eric
junkun
ghassan
cris
raymond
avery
roy
halley
mitzee
ziggy
rocky
twirly
max
huey
dewy
hongkongfooey
clarence
lala
sammy
fred
francis
Expert Answer
Answer to Using Java, I need to create a hash table to alphebetically sort a text file of names called “names.txt” and it needs to…