Assume that PA and PB are two distinctive programs. When PA is executed, a page reference string such as (4, 5, 10. 6. 5.10. 6. 7) wil be generated, where the first instruction of page #5 forks a new process which is executing PB. When PB is executed, a page reference string (4. 4, 4. 4) will be recorded. Assume that the execution of each page takes 1 tick, and each page fault needs 3 ticks to complete with a FCFS strategy. Assume that there are three processes Pi P2. and Ps are in the ready queue before t-0, and P, and P are executing PA while P2 is executing PB. Draw a Gantt chart if a R.R. scheduling with a TQ=2 ticks is used and assume that each process has a working set of 3 frames and a FIFO page replacement method is applied. Mark on the chart when a new process is arrived or done. Note that, RQ. VO Q. BQ. and WS for each process are required. Assume that PA and PB are two distinctive programs. When PA is executed, a page reference string such as (4, 5, 10. 6. 5.10. 6. 7) wil be generated, where the first instruction of page #5 forks a new process which is executing PB. When PB is executed, a page reference string (4. 4, 4. 4) will be recorded. Assume that the execution of each page takes 1 tick, and each page fault needs 3 ticks to complete with a FCFS strategy. Assume that there are three processes Pi P2. and Ps are in the ready queue before t-0, and P, and P are executing PA while P2 is executing PB. Draw a Gantt chart if a R.R. scheduling with a TQ=2 ticks is used and assume that each process has a working set of 3 frames and a FIFO page replacement method is applied. Mark on the chart when a new process is arrived or done. Note that, RQ. VO Q. BQ. and WS for each process are required