Write code to complete raise_to_power(). Note: This example is for practicing recursion; a non-recursive function, or using the built-in function math. pow(), would be more common. Sample output with inputs: 4 2 4^2 = 16

See the explanation

Explanation:

Note that, given a base number and and exponent we have that consists of multyplying b, e times. This means, to call the function e times of multiplying the result by b. Then consider the following code

int raise_to_power(int base, int exponent){

if exponent =0

then return 1

else

return base * raise_to_power(base,exponent-1)

}

Note that if base = 4 and exponent = 2

At first, we have that 2 is not 0, so it will multiply 4 times raise_to_power(4,1). But raise_to_power(4,1) will return 4 times raise_to_power(4,0). And raise_to_power(4,0)=1. So, the final result will be 4 * 4 * 1 = 16 which is de desired result.

x+2 because it just doubles hon so the pattern can actually tell you the expression.

so for example,

if x=2 then 2+2 is 4

if x=4 then 4+4 is 8

and so on and so forth.

i really hope that this makes sense and you out in a way hon: )

yes indeed

mayonaise pizza

good

dad gone me