1. Explain the concept of anonymous function in Scheme. Show an anonymous function that computes +6 and apply this anonymous function to compute 3 +4 = 5. 2. Write in Scheme a recursive function (er n), and a non-recursive (based on do-loop) function (ei n), that compute the following sum (approximation of e): 1+1/1! + 1/2! + 1/3! + ... + 1/n!, n>0. Example: > (er 2) 2.5 > (ei 10) 2.71828180114638