Please provide the solution in a Unix environment. (Operating System - CPU Scheduling )

Q3. Given a process scheduling table as below: Process Arrival Time P1 0 B 1 2 D 2 CPU Burst Time 6 3 4 2 What is the average turnaround time for these processes with the shortest Remaining Time First scheduling algorithm? Also calculate the average waiting time. Q4. Consider a system which has CPU bound process that requires a burst time of 40 units. Using he multilevel feedback queue scheduling, calculate the number of times the process will be interrupted if the time quantum on the first queue is 2 units and it increases by 5 units in other queues. | Q5. Clearly mark the algorithms listed below that could result in starvation. (explain why) You can assume that each process will use the CPU for a finite burst before performing I/O. i. First-come, First-Served ii. Round Robin (aka preemptive FCFS) iii. Shortest Job First iv. Shortest Remaining Time First (aka preemptive SJF) Priority vi. Priority-based Round Robin (aka preemptive Priority) vii. Multilevel Feedback Queue Scheduling V