Implement a prototype of a simple cache query handler.There are n data entries stored in the cache. Each entry is of the form $($timestamp$,$ key, value$),$ where timestamp represents the time at which the entry was stored in the cache, key represents the ID assigned to the cache entry, and value represents the data value of the entry, an integer represented as a string. The keys assigned to the cache entries may not be unique. The cache query handler receives q query requests, where each query is of the form $\{$key$,$ timestamp$),$ where key represents the ID of the cache entry to find, and timestamp represents the time the entry was added.