You are writing an application. You need a data structure that will allow you to store a large set of distinctive objects. The common operations performed on the set of objects are: lookup, insert, and delete. No traversal will be performed on the data set. The client wants the program to be as efficient as possible. Which of the following data structures should you use in your design?   Question 25 options:   hash table   linked list   heap   binary search tree

Due in C language

In Python NO IMPORT PICKLE Please check pictures and fix code. Write a program that keeps names and email addresses in a dictionary as key-value pairs.   This is the Required Output example:   Menu ---------------------------------------- 1. Look up an email address 2. Add a new name and email address 3. Change an existing email address 4. Delete a name and email address 5. Quit the program   Enter your choice: 2 Enter name: John Enter email address: John@yahoo.com That name already exists   Menu ---------------------------------------- 1. Look up an email address 2. Add a new name and email address 3. Change an existing email address 4. Delete a name and email address 5. Quit the program   Enter your choice: 2 Enter name: Jack Enter email address: Jack@yahoo.com Name and address have been added   Menu ---------------------------------------- 1. Look up an email address 2. Add a new name and email address 3. Change an existing email address 4. Delete a name and email address 5.…