[1] The running time of the algorithm is the sum of running times for each statement executed; a statement that takes Ci steps to execute and executes n times will contribute Ci * n to the total running time. Compute T (n), the running time of the following algorithm on an input of n values. State an asymptotic upper bound using O-notation.A(): int i, j, k, n;for (i=1; i<=n; i++) for (j=1; j<=i2; j++)for (k=1; k<=n/2; k++) printf(Hello);