Suppose that two algorithms, A and B, solve the same problem. Assume further that the size of instances of the problem is given by a parameter n. For each item below, assuming n is sufficiently large, indicate whether A is faster than B, if B is faster than A, or if we can not infer which of the two algorithms is faster. Justify each item.

- Algorithm A consumes time ? (n³) in the worst case and B consumes ? (n⁵) in the worst case.