Which multiplication problem can be used to determine how many possible combinations there ae for a lock consisting of 3 digits from 0-9, if the digits can be repeated?
O (3)(3)(3)
O (9)(9)(9)
O (10)(9)(8)
O (10)(10)(10)

29933333.33

step-by-step explanation:

since we know that the two functions are equal, f (x) = g

(x), therefore when we equate the two equations the result should be similar to

3x = x – 4:

a. f(x) = 3x, g(x) = x – 4

equating the two functions:

3x = x – 4             (correct)

so we now got our answer (a)

can i see a photo of the question so i can you?