An alternative strategy for the expo function uses the following recursive definition: expo(number, exponent) = 1, when exponent = 0 = number * expo(number, exponent – 1), when exponent is odd = (expo(number, exponent // 2)) ** 2, when exponent is even Define a recursive function expo that uses this strategy, and state its computational complexity using big O notation.

i think the answer is fried chicken ; >

step-by-step explanation:

a 4/6 = 9/12   not proportional

step-by-step explanation:

to find which are not proportional, we can use cross products

if it is true, they are proportional.   if it is not true, they are not proportional.

a 4/6 = 9/12

4* 12 = 6*9

48 = 54

not this is not proportional  

b 2/3 = 12/18  

2* 18 = 3 * 12

36 = 36

this is proportional

c 5/4 = 10/8  

5*8 = 4*10

40 = 40

this is proportional

d 7/5 = 35/25

7*25 = 5 * 35

175 = 175

is proportional

1 mph

step-by-step explanation:

if the question is asking how much does she drive per mile then,

13 / 13 = 1 mph

c

step-by-step explanation: