Question3 [9] Consider the following Racket function which determines whether some number occurs in a list of numbers. ;; search : number list-of-numbers- boolean (define (search n alist) (cond [ (empty? allist) false] [else (or (- (first alist) n) (search n (rest alist)))])) Prove by mathematical induction that: For every number n and any list of numbers L, (search n L) returns true fand only if n is in L Hint: Use induction on the length of the input list]