This method implements the logic to handle the completion of execution of a process in a Priority$-$based Preemptive Scheduler. Specifically, it takes three inputs:

$1.$ the ready queue $($an array of PCB structs$)$

$2.$ The number of items in the ready queue

$3.$ the current timestamp.

The method determines the process to execute next and returns its PCB$.$

If the ready queue is empty, the method returns the NULLPCB, indicating that there is no process to execute. Otherwise, the method finds the PCB of the process in the ready queue with the highest priority $($smaller integers for the priority field in the PCB mean higher priorities$),$ removes this PCB from the ready queue and returns it$.$ Before returning the PCB of the next process to execute, it is modified to set the execution start time as the current timestamp and the execution end time as the sum of the current timestamp and the remaining burst time.

The signature of the method is as follows:

struct PCB handle$\_$process$\_$completion$\_$pp$($struct PCB ready$\_$queue$[$QUEUEMAX$],$ int $*$queue$\_$cnt$,$ int timestamp$)$;