hash-problem.rkt

#lang racket

;; Write a function that takes a list l, of numbers,
;; and returns a hash which maps each number to its
;; square
;; 
;; hint: use a recursive (or tail-recursive) function
;; to loop over the elements of l and build up a hash
;; from each element, e, to (* e e). Finally, return
;; the hash.
(define (make-squares l)
  ;; correct type, but wrong result (no values)
  (hash))

;; This should return #t if you're correct
(equal? (make-squares '(1 2 3)) (hash 1 1 2 4 3 9))