Test Example Welcome to DrRacket, version 7.0 3m] Language: racket, with debugging: memory limit: 128 MB. (f pos 2-345-6)) (1 245) >(fneg 1 2 -345-6) 2. (30 points) Give to the predicate "p" a self-explain name. p(T ]) P(L]) p(IH T]-a(M,[H.T), p(M). a(lH T], B, [HICD-a(T, B, C). Hint The self-explain names for the predicate "a" are "append" or "concatenation" in names are not "f, "g""h", etc. The "not well known" names such as "Operation-Manhattan" have to be additionally explained 3. (30 points) Write in the SWI Prolog programming language a predicate to remove the first n elements of the list L All used predicates must be defined-written by the student. Test Example Fle Edt Settings Run Debug Help Please run -icense for legal detail Fer online help and background, visst heep://www. For built-in belp,-belplTopc) or-sproost tirst(1.2.3.4.1.2.3. 2. I) tirst(1.2.3.4.1.2.3 . X)