One technique for implementing lottery scheduling works by assigning processes lottery tickets, which are used for allocating cpu time. whenever a scheduling decision has to be made, a lottery ticket is chosen at random, and the process holding that ticket gets the cpu. the btv operating system implements lottery scheduling by holding a lottery 50 times each second, with each lottery winner getting 20 milliseconds of cpu time (20 milliseconds × 50 = 1 second). describe how the btv scheduler can ensure that higher-priority threads receive more attention from the cpu than lower-priority threads.