b) Describe a recursive algorithm that takes a list L of distinct integers and finds the finds the product df squares of the even numbers. Write your answer in pseudo-code or any well-known procedural language Python, Java, Ctt, In addition to the "even x" function above, you may assume that you have three functions that work on list ) "Z is empty" which returns TRUE if a given list is empty, FALSE otherwise i) "first of L" which returns the first element of a given nonempty list. ii) "rest of L" which returns a list containing all but the first element of a given nonempty list if the list has only one element, "rest" will return the empty list. (5 points) procedure Sum Of Squares_ Of Evens Primes (L list of integers)