Q2 ) (Process Scheduling) The table below lists five jobs, the time that they arrive in the system (when they are created), how long they take to execute, and their priority (higher values correspond to higher priorities). For example, job E arrives at time “50”, requires “20” units of execution time to complete, and has priority “0” which is the highest priority.

Process	Job Arrival Time	Execution Time	Priority
A	10	30	1
B	20	50	5
C	30	10	3
D	40	40	2
E	50	20	0

For all the jobs in each of the following scheduling algorithms, calculate (a) the Start Time, the time at which the job is first scheduled to run (it may have to wait when it arrives), and (b) the End Time, the time when it finishes executing.

i) First come First Serve (FCFS)

Process	Start Time	End Time
A
B
C
D
E

ii) Shortest Job First (SJF)

Process	Start Time	End Time
A
B
C
D
E

iii) Priority Scheduling (p)

Process	Start Time	End Time
A
B
C
D
E