1.2 minutes per hours is the correct answer
Answer:
It can be written as <span>f<span>(−8)</span></span> or <span>f<span>(3<span>(−2)</span>−2)</span></span>
Explanation:
You would substitute <span>−2</span> for the x in <span>3x−2</span> and then insert <span>3<span>(−2)</span>−2</span> for the g. You would end up with <span>f<span>(3<span>(−2)</span>−2)</span></span>, which can also be simplified to <span>f<span>(−8<span>)</span></span></span>
I will be using the language C++. Given the problem specification, there are an large variety of solving the problem, ranging from simple addition, to more complicated bit testing and selection. But since the problem isn't exactly high performance or practical, I'll use simple addition. For a recursive function, you need to create a condition that will prevent further recursion, I'll use the condition of multiplying by 0. Also, you need to define what your recursion is.
To wit, consider the following math expression
f(m,k) = 0 if m = 0, otherwise f(m-1,k) + k
If you calculate f(0,k), you'll get 0 which is exactly what 0 * k is.
If you calculate f(1,k), you'll get 0 + k, which is exactly what 1 * k is.
So here's the function
int product(int m, int k)
{
if (m == 0) return 0;
return product(m-1,k) + k;
}
Plug in 20 to W making 20-8, so your answer would be 12 :)
Convert 30% to a decimal .3 next multiply that by 32000 which equals 9600 kb
