I have to show if the following statement is true or false. Suppose we have two problems $A$ and $B$. We want to know whether the following is true:
If $A \le_p B$ and there is an algorithm which solves $B$ in linear time, then there is an algorithm which solves $A$ in linear time as well.
So we recently started with polynomial time reductions and I am not sure what to do for this problem.