Order the following Big-O time complexities from largest to smallest. n² n log n 2ⁿ n log n

a.

2ⁿ n² n log n n log n

b.

n² 2ⁿ n log n n log n

c.

log n n n log n 2ⁿ n²

d.

n log n n log n n² 2ⁿ