Find two strictly increasing functions such that f(n) is not O(g(n)) and g(n) is not O(f(n)), utilizing only simple operations (IE, Exponentials and Factorials are okay, but Tibor's "Busy Beaver" functions are not). Make sure that the functions are strictly increasing - for example, f(n) = Sin n and g(n) = Cos n fail to satisfy this requirement.