title: List length in scheme
body: <p>Hi I am trying to write a program where given a list of lists check to see if they are equal in size and return #t if they are.</p>
  
  <p>So for example if i were to write (list-counter? '((1 2 3) (4 5 6) (7 8 9))) the program would return #t, and (list-counter? '((1 2 3) (4 5 6) (7 8))) would return #f.</p>
  
  <p>SO far this is what I have done:</p>
  
  <pre><code> (define list-counter?
    (lambda (x)
      (if (list? x)
          (if (list?(car x))
        (let (l (length (car x))))
          (if (equal? l (length(car x))))
          (list-counter?(cdr x))
   ) ) ) ) ) 
  </code></pre>
  
  <p>I think where I am going wrong is after I set the length of l to the length of the first list. Any help would be appreciated.</p>