uppose we have five algorithms that solve a particular problem, which have the following complexities. Which one is most efficient for a large value of n$?$

Question $14$Select one:

a$.$

O$($n$)$

b$.$

O$($n log n$)$

c$.$

O$($n$2)$

d$.$

O$($n$3)$

e$.$

O$(2$n$)$