Could you please help me to solve the problem. Also, could you please answer questions in clear hand-writing and show me the full process, thank you (Sometimes I get the answer which was difficult to read).Thanks a lot

Suppose we are comparing implementations of two algorithms on the same machine. For input size of n, Algorithm A runs in 8n^2 steps, while Algorithm B runs in 64nlog₂(n) steps. For what value n>2, where n is an integer, does Algorithm A run in fewer steps than Algorithm B? (give your answer in whole number(s)).