Suppose we want to choose 3 letters, without replacement, from the 4 letters A, B, C, and D. a) How many ways can this be done, if the order of the choices matters?

b) How many ways can this be done, if the order of the choices does not matter?

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

answer:   rotate 270° clockwise about (7, 1) and reflect across the line x = 7

step-by-step explanation:

because i took test

step-by-step explanation: the answer for wha if rt is 10 centimeters long, and wha is st? it’s 6

if i put something wrong your not gonna like it so rather not say nothing.