Boyle 471 : Page 3, desplewento that a program reques memory is composed of three pages frames for public use and a,b,c,c,a,d requests pages in the following order: (10 points) a,b,c,c,a,d,f,c,g,f,g,b,d,e Using the FIFO page removal algorithm, perform a page trace analysis indicating page faults with asterisks (). Then compute the failure and success ratios. show your works ( 10 points) \begin{tabular}{|l|l|l|l|l|l|l|l|l|l|l|l|l|l|} \hline \multicolumn{2}{|l|}{ Answer } \\ \hlinea & b & c & c & a & d & f & c & g & f & g & b & d & e \\ \hline \end{tabular} Failure ratio = Success ration =