1. Write a scheme function named sum-it-all that takes a number as input and totals all the previous numbers up to 1. For example, if the input is 5 then 5+4+3+2+1 i.e. function should return 15. Also write a tail factorial version of it named sum-it-all-one which should also perform the same action as sum-it-all.

Sample runs: (sum-it-all 5) should return 15

(sum-it-all-one 5) should return 15

(sum-it-all 3) should return 6

(sum-it-all-one 3) should return 6