3. (3 points) At work, Jenifer needs to solve a problem of different sizes. She has two algorithms available to solve the problem. Algorithm A can solve the problem with size n in time I (n)=ra 47m2 +597 milliseconds while Algorithm B can solve the same problem in time Tz (n) = 501? + 300n +597 milliseconds. Find the minimum problem size n where Algorithm B runs faster than Algorithm A. You need to show you work to qualify for full credit Hint: you need to solve the inequality for T,(n)