compare the following pairs of functions and say whether f(n) is O (g(n)) for each of the following:

pair 1: f(n)=300,000,000 g(n)=1

pair 2: f(n)=300,000,000 g(n)=n

pair 3: f(n)=300,000,000 g(n)=n2

pair 4: f(n)=n g(n)=300,000,000

pair 5: f(n)=10 n g(n)=11 n

pair 6: f(n)=10 n g(n)=log(n)

pair 7: f(n)=n log(n) g(n)=2 n2

pair 8: f(n)=n2 log(n) g(n)=3 n3

pair 9: f(n)= square root of n g(n)=3 log(n)

pair 10: f(n)=n2 log2 (n) g(n)=3 n3

Your submission for part c should be a sequence of 10 False/True with the following meaning: if the 5th response is True it would mean that for the pair 5 f(n) is O(g(n)), on the other hand if 5th response is False then it would mean that for the pair 5 f(n) is NOT O(g(n)),