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

What is the smallest positive value of n, where n is an integer, such that Algorithm A, whose running time is 100n² runs faster than Algorithm B, whose running time is 2ⁿ , on the same machine (give your answer in whole number(s))