title: what is the complexity of int multiplyRec(int m, int n){ if(n == 1) return m; return m + multiplyRec(m, n - 1); }
body: <p>What is the time complexity of the following recursive relation? and how? </p>
  
  <pre><code>int multiplyRec(int m, int n){
  if(n == 1)
      return m;
  return m + multiplyRec(m,  n - 1);  
  </code></pre>
  
  <p>}</p>