Implement a ConcurrentHashMap and Understand its Thread-Safety

Design a thread-safe ConcurrentHashMap class. Requirements: Implement a hash table that supports multithreaded access similar to Java's ConcurrentHashMap. Explain how to implement lock mechanisms for efficient multithreading support. Discuss why a simple HashMap is not thread-safe. Provide the implementation part of the code, focusing on locking mechanisms. Data Scale: Support access from 1000 concurrent threads. Test Cases: Single thread insert and retrieve operations. Multiple threads inserting and retrieving, without contention. Multiple threads inserting and retrieving, with contention. Verify data consistency. Measure performance under high concurrency. Example Input put a 1 get a