Let F be an algorithm with complexity function f$($n$),$ and let G be an algorithm with complexity function g$($n$).$ If the ratio f$($n$)/$g$($n$)$ converges to $0$ as n increases to infinity, then $\_\_\_\_\_\_\_\_.$

Group of answer choices

the algorithm F is asymptotically faster than G

the two algorithms are asymptotically equivalent in efficiency

None of the above

the algorithm G is asymptotically faster than F