Question $7$

$1$ pts

Consider two algorithms:

Algorithm A with a time complexity of $O(N^2).$

Algorithm $B$ with a time complexity of $O(2^N).$

For very small values of $N,$ Algorithm $B$ might be faster. However, as $N$ grows, which statement is true regarding their execution times?

Algorithm $B$ will always remain faster than Algorithm A regardless of how large $N$ becomes.

The execution time of Algorithm A will exponentially outpace that of Algorithm B$.$

The execution times of both algorithms will converge and become equal.

Algorithm A will eventually be faster than Algorithm $B$ for sufficiently large $N.$