if n==1:returnm

ifnis even:

returnRPMult(n/2,2m)

else:

returnm+RPMult(n1,m)

1. Ifn= 2kis a power of 2, calculate the number of recursive calls before the algorithm terminates (until the base case.) in terms ofk.
2. Ifn= 2k1, calculate the number of recursive calls before the algorithm terminates (until the base case.) in terms ofk.