How to determine specific problems are NP hard or not?

Question

Suppose that you found a solution to the A problem and are trying to get some idea of its complexity. You solve A by calling your B s