Question: Consider the following Racket function which determines whether some number occurs in a list of numbers.;: search: Number ListOfNumber rightarrow Boolean (define (search n alist)

Consider the following Racket function which determines whether some number occurs in a list of numbers.;: search: Number ListOfNumber rightarrow Boolean (define (search n alist) (cond [(empty? alist) 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 if and only if n is in L
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
