The traditional unix scheduler enforces an inverse relationship between priority numbers and priorities: the higher the number, the lower the priority. The scheduler recalculates process priorities 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 used the cpu since priorities were last recalculated. Assume that recent cpu usage for process p1 is 40, process p2 is 18, and process p3 is.