$($e$)$ Algorithm A and Algorithm $B$ are two algorithms for solving the same problem. Assume that the worst$-$case time complexity of Algorithm $A$ is $T_A(n)=(n^2),$ and the worst$-$case time complexity of Algorithm $B$ is $T_B(n)=(nlo{g}_{2}n),$ where $n$ is the input size of the instance of the problem.

$[$Select$]$

Algorithm A is asymptotically faster than Algorithm B$.$ Algorithm A is asymptotically slower than Alsorithm B