can you please answer #5

Consider the following set of processes, with the length of the CPU burst time given in milliseconds. Processes may begin executing 1 ms after they arrive (i.e., a process arriving at time 5 could start executing at time 6) Any process arriving at time 0 is in the ready queue when the scheduler makes a decision about the first process to run. Determine the turnaround time for each process using each of the following scheduling algorithms: (i) first-come, first-serve (FCFS). (ii) shortest job first (SJF), (iii) shortest time to completion first (STCF), (iv) round-robin (RR) with time quantum -1 ms, and (v) a non- preemptive priority scheme in which lower numbers indicate higher priority. To break ties between processes (same burst time/priority), use first-come, first-serve ordering. a. Say the currently running process has 16 active pages, P0-P15, all of which have their reference bits set to 1. If the operating system uses the clock algorithm for page replacement, the pages are ordered numerically around the "clock (P0 is first, P1 is second, etc.), and the "clock hand" currently points to P6, which page will be replaced if a frame is needed to bring in a new page? Explain your answer for full credit. b. A portion of the currently running process's page table is shown below