The key point in analyzing the running time of a program is to determine the order of growth of the running time.

Consider a functional relationshi T$($n$)$ ~cf$($n$)$ where c is a constant and f$($n$)$ is a function known as the order of growth of the running time; n in input size.

Given an example analysis of the running time of a program, what is the order of growth?

number of instructions time per instruction in seconds frequency total time

$62$ x $10-9$ n$3/6-$ n$2/2+$ n$/3(2$n$3-6$n$2+4$n$)$ x $10-9$

$43$ x $10-9$ n$2/2-$ n$/2(6$n$2-6$n$)$ x $10-9$

$43$ x $10-9$ n $(12$n$)$ x $10-9$

$101$ x $10-911$ x $10-9$

Group of answer choices

n

n$^2$

n$^3$

$1$