Which asymptotic notation is defined by the following statement? F(n) = O(G(n)) and F(n) = N(G(n)) for all n > N = Little o Little w Big O Big Big 12 The most common variable used when stating an algorithms complexity is n. For instance, you can say an algorithm has O(n) or O(n log n). What does n commonly represent? O output size O number of lines of code O problem size number of operations