1. Consider the following pseudo-code:

AlgorithmApproxArea

Inputs: f (a function),

x₀, x₁(floating point numbers),

n(a positive integer)

Output: an approximation of the area underf(x)between x₀ and x₁ 1 sum:= 0

2 delta:= (x₁ - x₀) / n

3 x:= x₀

4 for i = 1 to n-1

5 x:= x + delta

6 sum:= sum + f(x)

7 return (delta/2) * (f(x₀) + (2 * sum) + f(x₁))

We are interested in the asymptotic complexity ofApproxArea as n grows large. In particular, we want to know T(n) = the number of times we evaluate the functionf, for a given value of n. Give a formula for T(n) and support it using an argument that refers to specific lines (by number) in the pseudo-code above. Remember that in pseudo-code, the bounds of a "for loop" are inclusive.