My code is showing a CPU utilization $\%$ of $100\%$ when it should be in the $80-90$ range. Correct it and let me know what I did wrong. I cant post all the processes so I included a screenshot since im running out of word count. "class Process: def $\_\_$init$\_\_($self$,$ pid, burst$\_$io$\_$sequence, arrival$\_$time$)$: self.pid $=$ pid self.burst$\_$io$\_$sequence $=$ burst$\_$io$\_$sequence self.current$\_$phase $=0$ self.remaining$\_$time $=$ burst$\_$io$\_$sequence$[0]$ if burst$\_$io$\_$sequence else $0$ self.arrival$\_$time $=$ arrival$\_$time self.start$\_$time $=$ None self.end$\_$time $=$ None self.in$\_$io $=$ False self.total$\_$waiting$\_$time $=0$ self.waiting$\_$time$\_$start $=0$ def $\_\_$str$\_\_($self$)$: return f$\text{'}$P$\{$self$.$pid$\}\text{'}$ def execute$($self$,$ current$\_$time$)$: if self.start$\_$time is None: self.start$\_$time $=$ current$\_$time self.remaining$\_$time $-=1$ if self.remaining$\_$time $==0$: self.current$\_$phase $+=1$ if self.current$\_$phase $$ len$($self$.$burst$\_$io$\_$sequence$)$: self.remaining$\_$time $=$ self.burst$\_$io$\_$sequence$[$self$.$current$\_$phase$]$ self.in$\_$io $=$ not self.in$\_$io else: self.end$\_$time $=$ current$\_$time # Record final completion time def sjf$($processes$,$ scale$\_$factor$)$: ready$\_$queue $=[]$ io$\_$queue $=[]$ current$\_$time $=0$ running$\_$process $=$ None total$\_$cpu$\_$time $=0$ results $=[]$ while any$($p$.$current$\_$phase $$ len$($p$.$burst$\_$io$\_$sequence$)$ for p in processes$)$: # Move arrived processes to ready queue for p in processes: if p$.$arrival$\_$time current$\_$time and p not in ready$\_$queue and not p$.$in$\_$io and p$.$current$\_$phase $$ len$($p$.$burst$\_$io$\_$sequence$)$: p$.$waiting$\_$time$\_$start $=$ current$\_$time ready$\_$queue.append$($p$)$ # Sort ready queue by remaining burst time for SJF ready$\_$queue.sort$($key$=$lambda x: x$.$remaining$\_$time$)$ # Debug: Print current state print$($f$"$Current Time: $\{$current$\_$time $/$ scale$\_$factor:$\mathrm{.}2$f$\},$ Running Process: $\{$running$\_$process$\},$ Ready Queue: $\{[$str$($p$)$ for p in ready$\_$queue$]\},$ IO Queue: $\{[$str$($p$)$ for p in io$\_$queue$]\}")$ # If no process is running, start the next process in the ready queue if running$\_$process is None and ready$\_$queue: running$\_$process $=$ ready$\_$queue.pop$(0)$ running$\_$process.total$\_$waiting$\_$time $+=$ current$\_$time $-$ running$\_$process.waiting$\_$time$\_$start # Execute the running process if any if running$\_$process: running$\_$process.execute$($current$\_$time$)$ total$\_$cpu$\_$time $+=1$ if running$\_$process.end$\_$time is not None and running$\_$process.current$\_$phase $==$ len$($running$\_$process.burst$\_$io$\_$sequence$)$: # Calculate turnaround time and response time turnaround$\_$time $=$ running$\_$process.end$\_$time $-$ running$\_$process.arrival$\_$time response$\_$time $=$ running$\_$process.start$\_$time $-$ running$\_$process.arrival$\_$time results.append$(\{$ "Process": running$\_$process.pid, $"$Tw$"$: running$\_$process.total$\_$waiting$\_$time, $"$Ttr$"$: turnaround$\_$time, $"$Tr$"$: response$\_$time $\})$ running$\_$process $=$ None # Process is complete # Process I$/$O queue elif running$\_$process and running$\_$process.in$\_$io: io$\_$queue.append$($running$\_$process$)$ running$\_$process $=$ None # Check I$/$O queue for p in io$\_$queue$[$:$]$: p$.$execute$($current$\_$time$)$ if not p$.$in$\_$io: # I$/$O is complete, so it's ready for CPU again p$.$waiting$\_$time$\_$start $=$ current$\_$time $+1$ ready$\_$queue.append$($p$)$ io$\_$queue.remove$($p$)$ # Increment current time current$\_$time $+=1$ if not running$\_$process and not ready$\_$queue: # Simulate idle time current$\_$time $+=1$ # Calculate CPU utilization and average metrics cpu$\_$utilization $=$ total$\_$cpu$\_$time $/$ current$\_$time avg$\_$waiting$\_$time $=$ sum$($r$["$Tw$"]$ for r in results$)/$ len$($results$)$ avg$\_$turnaround$\_$time $=$ sum$($r$["$Ttr$"]$ for r in results$)/$ len$($results$)$ avg$\_$response$\_$time $=$ sum$($r$["$Tr$"]$ for r in results$)/$ len$($results$)$ # Print table$-$like results print$($f$"$

SJF Scheduling Results $($CPU Utilization: $\{$cpu$\_$utilization:$\mathrm{.}2\%\})$:$")$ print$($f$"\{\text{'}$Process$\text{'}$:$<mn>1</mn><mn>0</mn><mi>\}</mi><mi>\{</mi><mi>\text{'}</mi>$Tw $($Waiting Time$)\text{'}$:$<mn>2</mn><mn>0</mn><mi>\}</mi><mi>\{</mi><mi>\text{'}</mi>$Ttr $($Turnaround Time$)\text{'}$:$<mn>2</mn><mn>0</mn><mi>\}</mi><mi>\{</mi><mi>\text{'}</mi>$Tr $($Response Time$)\text{'}$:$<mn>2</mn><mn>0</mn><mi>\}</mi><mi>"</mi><mi>)</mi>$ print$("-"*70)$ for result in results: print$($f$"\{$result$[\text{'}$Process$\text{'}]$:$<mn>1</mn><mn>0</mn><mi>\}</mi><mi>\{</mi>$result$[\text{'}$Tw$\text{'}]$:$<mn>2</mn><mn>0</mn><mi>\}</mi><mi>\{</mi>$result$[\text{'}$Ttr$\text{'}]$:$<mn>2</mn><mn>0</mn><mi>\}</mi><mi>\{</mi>$result$[\text{'}$Tr$\text{'}]$:$<mn>2</mn><mn>0</mn><mi>\}</mi><mi>"</mi><mi>)</mi>$ print$("-"*70)$ print$($f$"\{\text{'}$Average$\text{'}$:$<mn>1</mn><mn>0</mn><mi>\}</mi><mi>\{</mi>$avg$\_$waiting$\_$time:$<mn>2</mn><mn>0</mn><mn>.</mn><mn>2</mn>$f$\}\{$avg$\_$turnaround$\_$time:$<mn>2</mn><mn>0</mn><mn>.</mn><mn>2</mn>$f$\}\{$avg$\_$response$\_$time:$<mn>2</mn><mn>0</mn><mn>.</mn><mn>2</mn>$f$\}")$ # Define processes with arrival times and scaled burst times process$\_$data $=[$ Process$(1,[1,5,1,7,1,8,1,5,2,6,1,5,1,5,1],0),$ Process$(2,[1,8,1,7,2,8,3,7,3,9,2,5,3,7,2,8,2],0),$ Process$(3,[2,6,2,7,3,8,3,5,1,7,2,5,2,6,1,5,"```$

# Print