Is A faster than B for all n greater than some n0 if g(n) = Ω(f(n)logn)?

Question

Suppose that an algorithm A runs in worst-case time f(n) and that algorithm B runs in worst-case time g(n). Is A faster than B for all n greater than some n0 if g(n) = Ω(f(n)logn) ? Answer either yes, no, or can’t tell and explain why.

Answer 1

Yes...

B will be faster for n < 10^-Ω, afterwards A will always be faster.