Consider a set of n tasks with known runtimes $$r_{1} r_{2}....... r_{n}$$, to be run on a uniprocessor machine. Which of the following processor scheduling algorithms will result in the maximum throughput?

A

Round Robin

B

Shortest job first

C

Highest responseratio next

D

first cumfirst served