1) Write a java program that is able to apply ahash function to a first and last name (key) ofa person, and lookup the appropriate index in ahash table modeling a telephone directory. Thetelephone number (value) should be returned ondoing a lookup (you can prepopulate the tablewith 20 entries for this purpose). You can useexisting Java code (or libraries) to model thehash table, however, your program should becustomized to use the hash table structureappropriately.Demonstrate that your program works by providingmeaningful console messages that walk the testerthrough the search function in the directory.

2) Implement the same telephone directory searchusing a Binary Search Tree.You can use existing Java code (or libraries) to model the BST, however, your program should be customized to use the BST structure appropriately.Demonstrate that your program works by providingmeaningful console messages that walk the testerthrough the search function in the directory.