Some smart student from one of our competitor schools was hired to implement a page replacement strategy for a new operating system. Trying to be creative, the student implemented a strategy named LIFO which basically operates as FIFO, except that instead of the oldest page, it victimizes the newest page, i.e., one that was most recently fetched into memory. Faced with dismissal, the student argues that there are programs for which the strategy generates fewer page faults than LRU. Which one of the following page reference strings is going to generate fewer page faults under LIFO than under LRU when operating with 3 frames of memory? a. 123434343434 b. 123414242323 c. 123412123234 d. 123412341234