Question 1 (1 points): A first-come first-served scheduler will often be better than a round-robin scheduler at providing which of the following? Select all that apply A high portion of compute time used for application computations B. low variance in the wait times experienced by each of the threads being scheduled