I need help with these questions about Processor Management in Linux OS

Questions:

job	A	B	C	D	E	F
Arrival time	0	2	4	6	8	10
CPU Cycles	8	1	5	2	4	3

Refer to the table above to answer the following questions.

a) What is the average turnaround time for the First-Come, First-Served (FCFS) process scheduling algorithm?

b) What is the average turnaround time for the Shortest Job Next (SJN) process scheduling algorithm?

c) What is the average turnaround time for the Shortest Remaining Time (SRT) process scheduling algorithm?

d) What is the average turnaround time for the Round Robin process scheduling algorithm with a time quantum of 2?

e) Does changing the time quantum to 3 increase or decrease the average turnaround time for the Round Robin process scheduling algorithm?

Thanks