Reference no: EM133232952

Racket Programming Help. Do not use Python or Java,

There exists a function called find-middle, which looks through a list of three numbers and attempts to find how many times the middle number appears and keeps a running total. A sample problem would be:

(find-middle [1 5] [(2 1 5) (9 5 2) (2 4 6)]) where the the output would be 2 because 1 and 5 appear as the middle number twice. The function should let you check for as many numbers as you want, through as many lists as you want.