Build a Durable Key-Value Cache

Design and implement an in-memory key-value cache that uses a write-ahead log for durability. The cache should support at least the following operations: ```text put(key, value) get(key) delete(key) ``` Requirements: 1. Recent values should be served from memory with low latency. 2. Every mutation must be appended to a write-ahead log before it is considered successful. 3. If the process crashes and restarts, the cache should rebuild its in-memory state by replaying the log. 4. Deletions must remain durable after restart. 5. Discuss how to handle log growth, compaction, partial writes, and concurrency.