Can you please help with these two questions?

Qib. Assume that the largest problem instance that can be solved on a particular machine in time period T is X. What is the largest instance that could be solved in the same time period on a machine 200 times as fast? The problem instances are solved using an algorithm with time-complexity 3n +40. Show your working. (3 marks) Q2. Two algorithms are under consideration to solve a particular problem. Algorithm I performs 50n basic operations and algorithm 2 performs 'n basic operations, where the problem size is n. Ascertain at what problem size algorithm I starts to outperform algorithm 2. Show your working. (4 marks)