I am not really thinking of any nicely formed questions for this video that this program will grade nicely. So, I am going to go with... pick a number, between 7 and 12. (I don't know what happens at the border exactly, I wouldn't risk it. Please give your answer in decimal.) pts Consider the equations f(n) 128n2 and g(n) n. If we want to prove that f (n) = O (g (n)), using the definition for(), and using constant c 2, what is the smallest possible value for no? (Please give your answer in decimal format.)