Write a c code to implenent

$1.$Preemtive priority scheduling with aging where priority is decremented by $1,$ if the process remains in the ridicule for five time units

$2.$

Non$-$preemtive priority scheduling with aging where priority is decremented by one if the process remains in the rule for $5$ time units

Once each process is done processing its burst time it goes to the waiting queue then come back to the ready queue it is required to simulate the CPU schedule for a period of $200$ time units