Which recursive definition could be used to generate the sequence {1, 2,2,4,8,32}

8 apples are left.

step-by-step explanation:

10-2=8

10 apples

take 2

now u have 8

the correct functions are

h(x) = 3x + 2  

g(x) = 2^x

step-by-step explanation:

i proceed to calculate the different values ​​of k (x)

case 1)  k(x) = g(x) ∘ h(x)

g(x) ∘ h(x)=g(h(x))

k(x) = [2]^[3x + > is the option  4. k(x) = 2^(3x + 2 )

case 2)  k(x) = g(x) + h(x)

k(x) = [2^x]+[3x + 2]=2^x+3x+> is the option  1.) k(x) = 2^x + 3x + 2

case 3)k(x) = h(x) ÷ g(x)

k(x) =  [3x + 2]/[2^x]=3x/(2^x)+2/(2^x)=3x*(2^-x)+2^(1-x)

is the option  3.)   k(x) = (3x)2^(-x) + 2^(-x + 1 )

case 4)k(x) = g(x) - h(x)

k(x) =  [2^x]-[3x + 2]=2^x-3x-> is the option  2.) k(x) = 2^x - 3x - 2 

case 5)  k(x) = g(x) × h(x)

k(x) = [2^x]*[3x + > is the option  5.) k(x) = 2^x(3x + 2)

case 6)k(x) = h(x) ∘ g(x)

h(x) ∘ g(x)=h(g(x))

k(x)=3*[2^x]+> is the option  6. k(x) = 3(2^x) +2