1-7.[3] prove the correctness of the following recursive algorithm to multiply two natural numbers, for all integer constants c ≥ 2.function multiply(y, z)comment return the product yz.1. if z = 0 then return(0) else2. return(multiply(cy,⌊z/c⌋) + y • (z mod c))

let f (x ) is a function and c be a positive real number,   the graph of the function g (x ) = f (cx ) is represented as follows.

when, c > 1,   the function compresses it in the x - direction.

when, 0 < c < 1, the function stretches it.

the function is g ( x ) = (9x )2.

the heighest power of x in g ( x ) = (9x )2 is 2, so the parent function is square function.

the equation of parent function is f ( x ) = x 2 .

the function is g ( x ) = (9x )2 and the parent function is f ( x ) = x 2 .

so, the functions f and g have the following relationship.

g ( x ) = f ( 9x ).

compare the function g ( x ) = f ( 9x ) with g (x ) = f (cx ).

c = 9 ( > 1 ).

so, the function g (x ) = (9x )2 compresses it in the x - direction.

step-by-step explanation:

no

explanation:

you can be freinds, and people but not follow people.

to complete this square you have to rotate about the origin 270 degrees clockwise.

5 + 8 +7 + 4 + 0 +1 = 25

step-by-step explanation: