A and B are two algorithms for the same problem. The time complexity of A is

f$($n$),$ and the time complexity of B is

g$($n$)$

$,$ where

is the input size of the instance of the problem. Suppose that

lim$($n to infinity$)$ f$($n$)/$g$($n$)=0$

$.$ Which algorithm is faster?