Help please!!

Question3 19] Consider the following Racket function which determines whether some number occurs in a list of numbers. i search number 1 (define (search n alist) ist-of-numbers -> boolean (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 ofnumbers L, (search n L) returns true f and only ifn is in L [Hint: Use induction on the length of the input list]