title: Finding sum of fibonacci numbers recursively
body: <p>I'm a bit stuck here. I know a particular fibonacci number can be found recursively as so:</p>
  
  <pre><code>int fib (int n)
  {
      if (n &lt;= 1)
          return n;
  
      else 
          return fib(n-1) + fib(n-2);
  }
  </code></pre>
  
  <p>And I know iteratively I could call that function n times to find the sum of fibonacci numbers</p>
  
  <pre><code>int sum = 0;
  for (int i = 0; i &lt; n; i++)
  {
      sum += fib(i);
  }
  </code></pre>
  
  <p>But I'm having a hard time coming up with a recursive function to find the sum. I don't think it would be much different than the original fibonacci function. (This is for an assignment aimed at improving my ability to write ocaml syntax, not writing recursive functions)</p>