Suppose two algorithms, A and B$,$ that both perform the same task have Big$-$Oh complexities of

and

$,$ respectively. As the input size, n$,$ increases, which algorithm has better performance?