Use Racket (preferred) or python

Write a structurally recursive function (every? lob) that takes a list of booleans lob as its argument. A list of booleans has teh same structures as a list of numbers or a list of symbols, except the first item in each pair is a boolen value. every? returns #t if all of the booleans in lob are #t, and #f otherwise. For example:

 > (every? '(#t #t #t)) #t > (every? (map (lambda (n) (<= n 40)) '(26 37 41 25 12))) #f