In Task $1,$ you are asked to implement the SCHED AGING policy.

A task whose policy is set to SCHED AGING will behave identically to a SCHED NORMAL task in all respects

except when it undergoes a fork. When a SCHED AGING forks, the nice value of that task $($ie$.$ the parent

task after the fork$)$ will increase by $1.$ In contrast, the child task will inherit the parent$$s old $($pre$-$fork$)$

nice$-$value. The child of a SCHED AGING task must also be a SCHED AGING task. Additionally, if a task$$s

nice value is already the maximum possible nice value, it cannot increase on forking