Design a data structure that supports the following operations in O(1) time: get(index: int) -> int: Retrieve the value at the specified index. set(index: int, value: int): Update the value at the specified index. set_all(value: int): Set all elements in the data structure to the specified value. Requirements: The data structure should be initialized with a fixed size, and all elements should initially be set to 0. If set_all is called, subsequent get operations should return the globally set value unless the specific index has been updated after the set_all operation. d = DataStructure(1000) print(d.get(950)) # Output: 0 d.set(930, 5) print(d.get(930)) # Output: 5 d.set_all(8) print(d.get(950)) # Output: 8 print(d.get(930)) # Output: 8 d.set(910, 7) print(d.get(910)) # Output: 7 print(d.get(10)) # Output: 8

Implement local in-memory cache util that uses LRU as an eviction algorithm and works in a multithreaded environment. LRU means evicting the item that hasn’t been accessed the longest in case the cache is full. Each item should also hold a TTL and return Null when trying to fetch an item that its TTL passed. In addition, the cache should be limited in size. The perfomance (get, set) should be in optimal time.