Suppose an algorithm consists of two loops, where one loop executes and finishes, and then the other loop executes and finishes. We can easily determine the time complexities of the individual loops. To determine the time complexity of the entire algorithm, we should:

A. add the time complexities together
B. multiply the time complexities together
C. take the best (fastest) time complexity of the two
D. We would not be able to determine the time complexity of the algorithm with the information given.

A