Consider a computer system with a two-level cache hierarchy consisting of L1 (Level 1) and L2 (Level 2) caches. Both caches use a set-associative mapping. The system runs a program where its memory access pattern frequently accesses the same memory location multiple times within a short time frame. Which is the most suitable cache replacement policy for the L1 cache in the described scenario: Least Recently Used (LRU) First-In, First-Out (FIFO) Random Replacement Least Frequently Used (LFU)