PROCESS$*$ sjf$\_$process$\_$selector$($PROCESS$\_$LIST$*$ pl$)\{$

$//$ Don't change the first line of the existing code

PROCESS$*$ p;

$//$ Initialize the shortest process pointer to NULL

PROCESS$*$ shortest$\_$process $=$ NULL;

$//$ Iterate through the process list to find the process with the shortest remaining time

for $($int i $=0$; i $<$ pl$->$num$\_$processes; i$++)\{$

PROCESS$*$ current$\_$process $=$ pl$->$processes$[$i$]$;

$//$ If the current process is shorter than the previously found shortest process

$//$ or if there's no shortest process found yet, update the shortest process pointer

if $($shortest$\_$process $==$ NULL $||$ current$\_$process$->$time$\_$remaining $<$ shortest$\_$process$->$time$\_$remaining$)\{$

shortest$\_$process $=$ current$\_$process;

$\}$

$\}$

$//$ Assign the shortest$\_$process to p

p $=$ shortest$\_$process;

$//$ Return the process with the shortest remaining time

return p;

$\}$

"FAILED": $[$

"test$\_2$proc$\_0$entry$\_1$entry$\_$sjf$",$

$"5$proc$\_$sjf$"$

$]$

These Test cases are failing for this code.

Test$($SJF$,5$proc$\_$sjf$,.$disabled$=$false$)\{$

SCHEDULER$\_$STATS$*$ stats $=$ get$\_$empty$\_$stats$\_$block$()$;

SCHEDULER$\_$PARAMS params $=($SCHEDULER$\_$PARAMS$)\{$

$.$time$\_$slice $=1,$

$.$process$\_$selection$\_$func $=$ sjf$\_$process$\_$selector

$\}$;

test$\_5$proc$($params$,$ stats$)$;

cr$\_$expect$($stats$->$num$\_$processes$\_$started$==5)$;

cr$\_$expect$($stats$->$num$\_$processes$\_$completed$==5)$;

cr$\_$expect$($stats$->$completion$\_$time$==30\mathrm{.}0$f$)$;

cr$\_$expect$($stats$->$sum$\_$of$\_$turnaround$\_$times$==65\mathrm{.}0$f$)$;

cr$\_$expect$($stats$->$sum$\_$of$\_$response$\_$time$==29\mathrm{.}0$f$)$;

cr$\_$expect$($stats$->$average$\_$turnaround$\_$time $==13\mathrm{.}0$f$)$;

cr$\_$expect$($stats$->$average$\_$response$\_$time$==5\mathrm{.}80$f$)$;

printf$("-----------------------------------$

$")$;

$\}$

Test$($RR$,$ test$\_2$proc$\_0$entry$\_0$entry$\_$rr$,.$disabled$=$false$)\{$

SCHEDULER$\_$STATS$*$ stats $=$ get$\_$empty$\_$stats$\_$block$()$;

SCHEDULER$\_$PARAMS params $=($SCHEDULER$\_$PARAMS$)\{$

$.$time$\_$slice $=1,$

$.$process$\_$selection$\_$func $=$ rr$\_$process$\_$selector

$\}$;

test$\_2$proc$\_0$entry$\_0$entry$($params$,$ stats$)$;

cr$\_$expect$($stats$->$num$\_$processes$\_$started$==2)$;

cr$\_$expect$($stats$->$num$\_$processes$\_$completed$==2)$;

cr$\_$expect$($stats$->$completion$\_$time$==10)$;

cr$\_$expect$($stats$->$sum$\_$of$\_$turnaround$\_$times$==19)$;

cr$\_$expect$($stats$->$sum$\_$of$\_$response$\_$time$==1)$;

cr$\_$expect$($stats$->$average$\_$turnaround$\_$time $==9\mathrm{.}5)$;

cr$\_$expect$($stats$->$average$\_$response$\_$time$==0\mathrm{.}5)$;

printf$("-----------------------------------$

$")$;

$\}$

Make the changes in the code so the test case passes.