Assuming a physical memory of four page frames, give the number of page faults for the reference string a b g a d e a b a d e g d e for each of the following policies. (Initially, all frames are empty.) (a) Optimal (b) FIFO (c) Second-chance algorithm (d) Enhanced second-chance algorithm