(a) A small computer using paged memory has enough RAM to store four 1K pages. A process is using 6K of memory, and accesses the pages in the sequence: 1 23456 After this there are 10 more page accesses, of the pages. You decide how the pages are accessed but make sure that each page is accessed no more than a further two times, and the same page is not accessed consecutively. Calculate how many page faults will be generated. (10 marks if you use the Clock Algorithm) (5 marks if you use the LRU (Least Recently Used) Algorithm) (For either algorithm, you must show your working out) (b) There are 6 processes A-F. Each of these has a runtime. For each of the processes choose a runtime from between 3 and 8 seconds. No two processes should have the same runtime. A small single-processor computer is executing the set of processes: Process A starts at time 0 seconds Process B starts at time 1 second Process C starts at time 2 seconds Process D starts at time 3 seconds Process E starts at time 4 seconds Process F starts at time 8 seconds Show the sequence of events if these processes are scheduled using the pre-emptive SRT (Shortest Remaining Time) algorithm