Please help, trying to complete this by tonight to help me study for my exam, but I am stuck after trying many times.

4. Finish writing the program, called 'got milk ,that is bellow. It checks a list for the word "milk". It should return true (#t) or false (#f). We can assume the list is of atoms (that it has no sub-lists). You might want to use the build-in function eq? to test for equality e.g. (eg? a (car (a b))) it define got milk alist) (cond null? alist if) got milk ("bread", "cheese", "tomates", "milk")) 5. Write a function, called 'sum', that sums all the elements of a list. Extra Credit, write this function so that it sums up all the elements ofa list including all sub-lists. 6. Consider the following Scheme function and then determine: define foo (list 1 2 5 6 9)) define bar (list o 2 5 7 9)) define mystery list1 list2 (cond (null? list1 member (car list1) list2 cons (car list1) (mystery (car list1) list2))) (else (mystery (cdr list1) list2)) What would be the result (what would be the output) if we ran the command below? (mystery foo bar)