1. Suppose a computer has 500 Mbytes memory for user programs, three jobs are submitted at the same time with the attributes listed below: Type of job duration Memory required Need disk Need printer Job1 Heavy compute 14 min 110 M No No Job2 Heavy 1/0 30 min 300 M Yes No Job3 Heavy I/O 25 min 150 M No Yes Compute the Throughput per hour and per day and the Elapsed time if the jobs run under multiprogramming system? (2.5 Marks) 2. A process references five pages, A, B, C, D, and E, in the following order: A; B;D; A; C;E;D; A; C; B; B Assume that the replacement algorithm is first- in- first-out (FIFO) and find the number of page transfers during this sequence of references starting with an empty main memory with four page frames. (2.5 Marks)