I know the answer is f(n) is Big O of g(n).

This is the graph for f(n) and g(n). Here when C is 1, this is the case and f(n) is upper bounded by g(n).
When I'm giving 0.1 as the C value, as shown below, we see that for sufficiently large values of n, f(n) is actually lower bounded by g(n).
Does this mean f(n) is actually big theta(g(n)) or am I missing something?
