Question

jim is excited because he has just been delivered a new computer but he has a dilemma. it seems that the operation system scheduling works a little differently compared to what he has been before.he finds that he cannot force the computer to switch tasks and tasks that were given to the computer earlier are being executed after tasks that were submitted at later time. he now has the task of figuring out the time at which a batch of tasks will be completed given their submit times and runtime duration. note: if 2 tasks are submitted at the same time , the one encountered earlier in the input array is executed first.
input1: N number of tasks
input2:an array of N elements. each element contains: of ith task.
input3:an array of N elements.each elements contains :of ith task.
output: the function should return the final end time of the last task to be executed.
example 1:
input1:1
input2:{0}
input3:{4}
output:4
example2:
input1:5
input2:{0,3,9,2,6}
input3:{3,4,2,9,6}
output:24

Answer 1

Answer:

This is possible only with process scheduling. Fair allocation of CPU. First Come First Serve (FCFS): Simplest scheduling algorithm that schedules according to arrival times of processes. First come first serve scheduling algorithm states that the process that requests the CPU first is allocated the CPU first.

Explanation:

please make Brinliest