Answer all questions based on the following information: Process size = 490K = 70K Page size Memory size = 210K Address sequence = 12, 15, 180, 185, 245, 360, 270, 158, 165, 70, 436, 251 a) How many pages the program will have? (page quantity = process size / page size) b) How many frames the program need? (frame quantity = memory size / page size) c) At 70K per page, what is the reduced reference string? (reference string = address sequence / page size) e.g., 12/70 = 0.17 , ref string (page number) = 0, 0.17 (use to calculate displacement) exact location = page size * 0.17; 70 * 0.17 = 11.9 (~ displacement 12 at page 0) (e.g: reference string = 100 3 4 4 5 so the reduced reference string = 1 0 3 4 d) How many page faults will be when using FIFO and LRU algorithm