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.

answer: 0.1,0.85

step-by-step explanation:

on the middle line

step-by-step explanation:

1/5=50

p(x)= 8 x³ - 36 x² + 54 x - 27

q(x) = 2 x -3

you can check your mistake and then you can choose the correct option.

dividend =   8 x³ - 36 x² + 54 x - 27

divisor = 2 x -3

if you want to find quotient, proceed as follows

q(x)= 0

2 x - 3=0

x =

now , i have used division method , to find quotient and remainder