title: Scheme function that returns the odd-numbered elements from a list in reverse
body: <p>I have to create a recursive Scheme function for my programming class that will take all the odd-numbered elements of a list, and then return them in reversed order. </p>
  
  <p>I have a function for reversing a list, and another function for getting the odd-numbered elements, but can't figure out how to combine the two into a <em>new</em> function, as they both are recursive. </p>
  
  <p>It has to be <em>one</em> function that doesn't call any functions other than itself. It can not call <code>odd</code> or <code>reverse</code>, and it has to have the same functionality as calling <em>both</em> would have.</p>
  
  <p>Odd Function:</p>
  
  <pre><code>(define (odd lst)
      (if (null? lst)                   
          '()                          
          (cons (car lst)              
                (odd (cddr lst)))))
  </code></pre>
  
  <p>Reverse Function:</p>
  
  <pre><code>(define (reverse lst)
     (if (null? lst)
         '()
         (append (reverse (cdr lst))
                 (list (car lst)))))
  </code></pre>
  
  <p>Any help would be appreciated!</p>