Suppose that algorithm A takes 1000n^3 steps and algorithm B takes 2^n steps (Note the carot symbol ^ means raise to the power of which we use here becuase we cannot create the appropriate mathematical symbol in moodle) for a problem of size n. For what size of problem is algorithm A faster than B (meaning algorithm A has fewer steps than B)? In your answer describe not only what the answer is but how you arrived at the answer.