GATE Computer Science (CS) 2021 Shift 1 Solved Paper

Three processes arrive at time zero with CPU bursts of 16, 20, and 10 milliseconds. If the scheduler has prior knowledge about the length of the CPU bursts, the minimum achievable average waiting for these three processes in a non-preemptive scheduler (rounded to the nearest integer) is ______ milliseconds.