Show that an algorithm that makes at most a constant number of calls to polynomial time subroutines runs in polynomial time, but that a polynomial number of calls to polynomial-time subroutines may result in an exponential time algorithm.

For the first part, can I say that the algorithm runs in O(x^m) where x^m is the longest run time of all the subroutines?

I have no idea for part 2