NP-hardness given some reducible language
Hint: if $A$ is NP-hard, and it can be reduced in polynomial time to $B$, what can you say about $B$? Then if you have a polynomial time algorithm for $B$, what does that imply? (Check out the definition of NP-hardness and NP-completeness).