The complexity of a computer algorithm is the number of operations or steps the algorithm needs to complete its task assuming there are n pieces of input (for example, the number of steps needed to put n numbers in ascending order). Four algorithms for doing the same task have complexities of A: n^3/2, B: n log₂ n, C: n(log₂ n)², and D: √n log₂ n. Rank the algorithms in order of increasing efficiency for large values of n. Graph the complexities as they vary with n and comment on your observations.