undefined

Fect Question 3 0 / 20 pts Select the best answer. An algorithm A implemented and compiled on a machine M1 has a execution time T(n). Suppose that the algorithm A is compiled with a different compiler that produces en average half the number of machine instructions per pseudocode instruction. Then the algorithm A compiled with the new compiler will have an execution time O 2.T(n) k.T(n) where k > 1 k.T(n) where O 1 k.T(n) where