Describe the difference of degree to which the following scheduling algorithms discriminate in favor of short processes: (a) First-Come-First-Serve. (b) Round-Robin. (c) Multilevel feedback queues.

Suppose i pick a jelly bean at random from a box containing one red and eleven blue ones. i record the color and put the jelly bean back in the box. if i do this three times, what is the probability of getting a blue jelly bean each time? (round your answer to three decimal places.)