I had quiz last week and it says : suppose algorithms A1 and A2 have worst-case time bound p and q,respectively.
Suppose algorithm A3 consists of applying A2 to the output of A1.(The input for A3 is the input for A1.)
Give a worst-case time bound for A3.

How could i calculate the worst case based on the given info ?