Solution

The correct answer is Both Statement I and Statement II are incorrect 

EXPLANATION:

• Statement I: This is incorrect.
  • The notation f = O(g) means that the growth rate of function f is bounded by the growth rate of function g, up to a constant factor and beyond a certain point.
  • If, in addition, g is not little o of f (meaning, g does not grow significantly slower than f beyond that certain point), then that doesn't bear on f growing faster than g. Instead it should mean that f does not grow faster than g and g does not grow significantly slower than f.
• Statement II is incorrect.
  • The class of decision problems decided by a Turing Machine (TM) in exponential time is typically denoted by EXP, and it is associated with O(2^poly(n)), where "poly(n)" represents a polynomial in the input size n.
  • The statement wrongly suggests that the class is O(2^k), where k is a constant. In reality, the exponent in the exponential time complexity is a polynomial function of the input size.