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 $2$ as n increases to infinity, then $\_\_\_\_\_\_\_\_.$

Group of answer choices

implementations of F will require twice as much space as implementations of G

the two algorithms are equivalent in efficiency and there is no clear winner

implementations of F will require twice as much time as implementations of G

we can deduce that F runs in linear time while G runs in quadratic time