Question: "Implement a data structure to efficiently store and retrieve employee records in a large organization. The data structure should allow for the following operations with optimal time complexity:

Add a new employee record $($with fields such as employee ID$,$ name, department, and position$).$

Retrieve an employee's record using their employee ID$.$

Update an employee's details.

Delete an employee's record.

List all employees in a given department.

Discuss your choice of data structure$($s$),$ and explain why it is suitable for this application. Additionally, write pseudocode for each operation and analyze the time complexity of these operations. How does your data structure handle collisions $($if applicable$),$ and how does it scale with a large number of employee records?"

This question is designed to test several key competencies in computer science:

Understanding of Data Structures: Selecting the right data structure$($s$)$ for the task, such as hash tables, binary search trees, or more advanced structures like trie or B$-$trees.

Algorithm Implementation: Ability to implement basic operations like add, retrieve, update, and delete, considering the chosen data structure.

Complexity Analysis: Evaluating the efficiency of each operation in terms of time complexity.

Handling of Specific Requirements: Customizing the data structure to handle specific requirements like listing all employees in a department.

Scalability and Collision Handling: Considering how the data structure performs as the number of records grows and how it deals with potential issues like hash collisions.

This question is practical and relevant to real$-$world applications, challenging students to apply theoretical knowledge to a practical problem.

please show your work in screen shot also give me