Suppose the algorithms have the following runtime complexities:

• A: n^-1/2
• B: 42
• C: n^1/20
• D: log(n)

Order the algorithms from most efficient (fastest) to least efficient (slowest).

Group of answer choices

A, B, D, C

B, A, C, D

B, A, D, C

A, B, C, D

Suppose the algorithms have the following runtime complexities: . A n 112 B: 42 . C:n 1/20 D: log(n) Order the algorithms from most efficient (fastest) to least efficient (slowest). O A, B, D, OB, A, C, D OB, A, D, C A, B, C, D