Need only explanations for (ii) and (iii), thank you.

(b) Consider the following recursive algorithm multi(n,m). Algorithm multi(n, m) //Input: two integers n and m //Output: ? if n==1 return m else return m + multi(n-1, m) (i) Perform the box-trace of the algorithm for n=4, m=9. Specify the output. [3 marks] (ii) For which values of n and m will the algorithm fail to terminate? [2 marks] (iii) For values of n and m, for which algorithm terminates, what will be the value returned? Provide a brief explanation. [2 marks]