QUESTIONS 1. (40 points) Write in the Racket programming language a function to compute a list that consists of all elements of the given list for which the given condition is true. All functions except (car, cdr, cons, define, if, cond, else, null?,>. (fneg (1 2-345-6) 2. (30 points) Give to the predicate "p" a self-explain name. p(l D P( p([H Ta(M, [H]. T), p(M). a(HT], B, [H C)-a(T, B, C). Hint The self-explain names for the predicate "a" are "append" or "concatenation" The self-explain names are not "f The "not well known" names such as "Operation-Manhattan" have to be additionally explained , "g", "h", etc. 3. (30 points)