Do it in scheme language please

Write your own Scheme functions for the following operations: 1. (found elst) that returns #tife is en element of the list 1st. Othe 2. (set? Ist) that returns #tif the list Ist is a set (con 3. (square? n) that returns #t if n is a square (e.g. 0 14 9 16 4. (count2 Ist) that counts the n tains all different elements) (e.g. (count2 (1 2 3 4)) should return 2) umber of elements of the list Ist that are squares en Ist) that counts the (allsqua (sumsquares lst) number of elements of the list Ist. (Do not use length!) 6. 7, st) that returns #t ifall elements of the listist are squares. Otherwise, return ar sum o g that returns the sum of all elements of the list Ist that are squares