The following recursive method calculates 3n : // precondition: n > = 0 public int power3(int n) { if (n == 0) // if n equals to 0 return 1; else { int p = power3(n/2); // when n is odd, n/2 is truncated to an integer // e. g., 7/2 gives 3 and 1/2 gives 0 p *= p; // multiply p by itself if (n % 2 == 1) // if n is odd p *= 3; // multiply p by 3 return p; } } how many multiplications will be performed when the program calls power3(15)?

instagram is better than go there instead lol

step-by-step explanation:

2.

according to newton’s cannonball model, what happens if the cannonball's velocity is enough to overpower the pull of earth’s gravitystep-by-step explanation:

step-by-step explanation:

solution:

→c= a b , that is product of a and b is possible only when when a is m × n matrix and b is n × p matrix.

that is, number of columns of a= number of rows of b.

so, size of matrix , c= a b is , if a = (m × n)matrix

b= (n × p)matrix

then a b = [ (m × n)matrix] ×[   (n × p)matrix ]

→→c= a b= [m × p ] matrix

→→size of product a b will be equal to = number of rows of a × number of columns of b