def shortest$\_$Job$\_$First$($processes$)$:

GanttChart $=[]$

temp $=0$

ready$\_$queue $=[]$

waiting$\_$queue $=[]$

currentnTime $=0$

Timer $=0$

GanttChart.append$(($processes$[0].$num, currentnTime, currentnTime $+$ processes$[0].$Burst$\_$time$))$

currentnTime $+=$ processes$[0].$Burst$\_$time

processes.sort$($key$=$lambda y: $($y$.$Burst$\_$time$))$

while Timer $<200$:

for process in processes:

if Timer $<200$:

if currentnTime $+$ process.Burst$\_$time $<=200$:

if waiting$\_$queue:

found$\_$waiting $=$ False

for waiting$\_$process in waiting$\_$queue:

if temp $>=$ waiting$\_$process.Comes$\_$back$\_$after:

ready$\_$queue.append$($waiting$\_$process$)$

waiting$\_$queue.remove$($waiting$\_$process$)$

found$\_$waiting $=$ True

break

else:

break

if not found$\_$waiting:

ready$\_$queue.append$($process$)$

running$\_$process $=$ ready$\_$queue.pop$(0)$

GanttChart.append$(($process$.$num, currentnTime, currentnTime $+$ process.Burst$\_$time$))$

waiting$\_$queue.append$($running$\_$process$)$

temp $+=$ process.Burst$\_$time

process.waiting$\_$time $=$ max$(0,$ currentnTime $-$ process.Arrival$\_$time$)$

process.turnaround$\_$time $=$ process.waiting$\_$time $+$ process.Burst$\_$time

currentnTime $+=$ process.Burst$\_$time

currentnTime $+=$ process.Burst$\_$time

Timer $=$ currentnTime

else:

running$\_$process $=$ ready$\_$queue.pop$(0)$

GanttChart.append$(($running$\_$process.num, currentnTime, currentnTime $+$ running$\_$process.Burst$\_$time$))$

waiting$\_$queue.append$($running$\_$process$)$

temp $+=$ running$\_$process.Burst$\_$time

process.waiting$\_$time $=$ max$(0,$ currentnTime $-$ process.Arrival$\_$time$)$

process.turnaround$\_$time $=$ process.waiting$\_$time $+$ process.Burst$\_$time

currentnTime $+=$ running$\_$process.Burst$\_$time

Timer $=$ currentnTime

else:

ready$\_$queue.append$($process$)$

running$\_$process $=$ ready$\_$queue.pop$(0)$

GanttChart.append$(($process$.$num, currentnTime, currentnTime $+$ process.Burst$\_$time$))$

process.waiting$\_$time $=$ max$(0,$ currentnTime $-$ process.Arrival$\_$time$)$

process.turnaround$\_$time $=$ process.waiting$\_$time $+$ process.Burst$\_$time

currentnTime $+=$ process.Burst$\_$time

waiting$\_$queue.append$($running$\_$process$)$

currentnTime $+=$ process.Burst$\_$time

Timer $=$ currentnTime

# Calculate average waiting time and average turnaround time

avg$\_$waiting$\_$time $=$ calculate$\_$average$\_$waiting$\_$time$($processes$)$

avg$\_$turnaround$\_$time $=$ calculate$\_$average$\_$turnaround$\_$time$($processes$)$

return GanttChart, avg$\_$waiting$\_$time, avg$\_$turnaround$\_$time edit it to give me this output Shortest Job First:

GANTT CHART:

$0$ P$110$ P$614$ P$519$ P$725$ P$629$ P$534$ P$740$ P$644$ P$549$ P$755$ P$659$ P$564$ P$770$ P$674$ P$579$ P$785$ P$689$ P$594$ P$7100$ P$6104$ P$5109$ P$7115$ P$6119$ P$5124$ P$7130$ P$6134$ P$5139$ P$7145$ P$6149$ P$5154$ P$7160$ P$6164$ P$5169$ P$7175$ P$6179$ P$5184$ P$7190$ P$6194$ P$5199$ P$7200$

Average waiting time $=41\mathrm{.}5$

Average turnaround time $=145\mathrm{.}5$