Quantori services may need a bounded in-memory cache for recently accessed event-processing results. Implement a Least Recently Used (LRU) cache that evicts the least recently accessed item when its capacity is exceeded.
Your function receives a positive capacity and a sequence of operations. Each operation is either get(key) or put(key, value). A get returns the stored value, or -1 if the key is absent. A successful get marks the key as most recently used. A put inserts or updates a key and marks it as most recently used. If insertion exceeds the capacity, remove the least recently used key. Return the results of all get operations in order.
Implement lru_cache_operations(capacity, operations).
capacity is an integer.operations is a list of tuples. Each tuple is either ("get", key) or ("put", key, value).key and value are integers.get operation.def lru_cache_operations(capacity, operations):