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$[0].$waiting$\_$time $=$ max$(0,$ currentnTime $-$ processes$[0].$Arrival$\_$time$)$

processes$[0].$turnaround$\_$time $=$ processes$[0].$waiting$\_$time $+$ 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

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

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

process.turnaround$\_$time $=$ process.waiting$\_$time $+$ 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

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

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

process.turnaround$\_$time $=$ process.waiting$\_$time $+$ 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$))$

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

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

Timer $=$ currentnTime

else:

currentnTime $=200$

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 $........$the algorithm true but the avg waiting tima and around time false it should to be Average waiting time $=41\mathrm{.}5$

Average turnaround time $=145\mathrm{.}5,,$please fix the code to get this results