24. The traditional UNIX scheduler enforces an inverse relationship between priority numbersand priorities: the higher the number, the lower the priority. The scheduler recalculates processpriorities once per second using the

following function: Priority = (recent CPU usage / 2) + base where base = 60 and recent CPU usage refers to a value indicating how often a process has usedthe CPU since priorities were last recalculated. Assume that recent CPU usage for process P1 is 40, for process P2 is 18, and for process P3 is10. What will be the new priorities for these three processes when priorities are recalculated?Based on this information, does the traditional UNIX scheduler raise or lower the relative priority of a CPU-bound process?

Fig: 1

Fig: 2

Fig: 3

Fig: 4