How many recursive calls do recursive algorithms t(n)≤10t(n/9) cnlogn.

for this pair of functions g(x)=x-2 and f(x)=|x| is (g o f)(a)= |a| -2

step-by-step explanation:

g(x)=x-2

f(x)=|x|

(g o f)(a)=?

(g o f)(x)=g(f(x))

(g o f)(x)=g(|x|)

(g o f)(x)=|x|-2

(g o f)(a)=|a|-2

second option

step-by-step explanation:

the measures of a triangle equal 180. use that to find x.

2x+3x+4x=180

9x=180

9x/9=180/9

x=20

now you know x, you know angle a is 40°, angle b is 60°, angle c is 80°.

because angle a is 40°, the first option doesn't work.

because angle b is 60°, the second option does work.

when you add angle a and b, you get 100°. complementary means it equals 90°, so the third option doesn't work.

when you add angle a and c, you get 120°, which is not 100.

the answer is a.

step-by-step explanation:

in three games of golf, alex shot two under par four times.

oof

step-by-step explanation: