<prompt> Kuandika Java Programu ambayo kutekeleza LRU cache.  <response>: Sure, here is a sample Java program that implements LRU cache using a LinkedHashMap:import java.util.LinkedHashMap;import java.util.Map;public class LRUCache extends LinkedHashMap private final int maxSize; public LRUCacheint maxSize supermaxSize 1, 1.0f, true; this.maxSize maxSize; Override protected boolean removeEldestEntryMap.Entry eldest return super.size maxSize; public static void mainString args LRUCache cache new LRUCache3; cache.putA, 1; cache.putB, 2; cache.putC, 3; System.out.printlncache; output should be A1, B2, C3 cache.putD, 4; System.out.printlncache; output should be B2, C3, D4 cache.getB; System.out.printlncache; output should be C3, D4, B2 The LRUCache class extends LinkedHashMap and overrides the removeEldestEntry method to determine when the cache needs to remove the least recently used entry. The main method demonstrates how to use the LRUCache class to store key-value pairs and retrieve them, while ensuring that the cache evicts the least recently used entries when necessary. 