hello please read all the instruction carefully and do the step by step for me so i can uderstand and please do level the number which one is for what number and please Its a whole full assignment but they have a number like part by part inside so if you can do all i would really appreciate it thank you so much.

1. Consider the arrival time and burst time of four jobs specified in the table below. a. Apply the Shortest Remaining Time to Finish (SRTF) with IO operating system algorithm. b. Generate a table to identify the process id, exit time, turn around time, waiting time, and response time. c. Generate a Gantt chart to show how/when each process is executed by the CPU. d. Generate a Gantt chart to show how/when each process enters/leaves the waiting state for IO. e. Calculate the average turn around time of the processes. f. Calculate the average wait time of the processes. g. Calculate the average response time of the processes. 2. Consider the arrival and burst time of five jobs specified in the table below. a. Apply the Round Robin operating system scheduling algorithm. b. Time quantum of the system is 6 units. c. Generate a table to identify the process id, exit time, turn around time, waiting time, and response time. d. Generate a Gantt chart to show how/when each process is executed. e. Calculate the average turn around time of the processes. f. Calculate the average wait time of the processes. g. Calculate the average response time of the processes. 3. Consider the arrival time and burst time of six jobs specified in the table below. a. Apply the Highest Response Ratio Next (HRRN) operating system scheduling algorithm. b. Generate a table to identify the process id, exit time, turn around time, waiting time, and response time. c. Generate a Gantt chart to show how/when each process is executed. d. Calculate the average turn around time of the processes. e. Calculate the average wait time of the processes. f. Calculate the average response time of the processes. 4. Consider the arrival time and burst time of seven jobs specified in the table below. a. Apply the Priority Preemptive operating system scheduling algorithm. b. Given Priority, the lower the value, the higher the priority. c. Generate a table to identify the process id, exit time, turn around time, waiting time, and response time. d. Generate a Gantt chart to show how/when each process is executed. e. Calculate the average turn around time of the processes. f. Calculate the average wait time of the processes. g. Calculate the average response time of the processes. Average Turn Around time = Average waiting time = Average response time = 5. Consider the arrival time and burst time of three jobs specified in the table below. a. Apply the Priority Non-preemptive operating system scheduling algorithm. b. Given Priority, the lower the value, the higher the priority. c. Generate a table to identify the process id, exit time, turn around time, waiting time, and response time. d. Generate a Gantt chart to show how/when each process is executed. e. Calculate the average turn around time of the processes. f. Calculate the average wait time of the processes. g. Calculate the average response time of the processes