title: Scheme - Return list of N Repetitions of said list
body: <p>First off, this is a homework question so just looking for guidance and not an answer. </p>
  
  <p>Write a function named (cycle ALIST N) that accepts a list of elements ALIST and an integer N. This function returns a list containing N repetitions of the elements of ALIST. If N is non-positive, this function returns the empty list. </p>
  
  <p>I will be honest in that I'm not sure how to begin solving this problem. I've been thinking of writing a helper function then using cons calling this n times but just looking if I'm on the correct track here.</p>