operating system

5.Assume the following jobs execute on one processor:
Job Burst time Priority
-------------------------------------
1 10 3
2 1 1
3 2 3
4 1 4
5 5 2
Jobs arrive in the order1, 2, 3, 4, 5 at time 0. Illustrate the execution of jobs using FCFS, SJF, RR (Q=1) and non-preemptive priority algorithms. Find the average turnaround time for each of the algorithms.
7. Consider the following sequence of memory references from a 460 word program:
10, 11, 104, 170, 73, 309, 185, 245, 246, 434, 458, 364.
Find the total number of page faults using LRU and FIFO page replacement policies. Assume a page size of 100 words and that the main memory is divided into 3 frames.