Write your own Scheme functions for the following operations: 1. (found e lst) that returns #t ife is en element of the list lst. Ot 2. (set? lst) that returns #tif the list 1st is a set (cont 3. (square? n) that returns #t if n 4. (count2 Ist) that counts the se, return #f. ains all different elements) is a square (e.g. 0 1 4 9 16 ). Otherwise, return #f number of elements of the list lst that are squares (e.g. (count2 (1 2 3 4)) should return 2) 5. (len lst) that counts the number of elements of the 6. (allsquares? lst) tha 7. (sumsquares Ist) that returns the sum of all elements of the ist is list Ist. (Do not use length!) t returns #ti fall elements of the list lst are squares. Otherwise, return