Question :
Suppose an algorithm requires cn2 operations when performed with an input of size n (where c is a constant).
a. How many operations will be required when the input size is increased from m to 2m (where m is a positive integer)?
b. By what factor will the number of operations increase when the input size of m is doubled?
c. By factor will the number of operations increase when the input size of m is increased by a factor of 10 that is, n = 10m)?