Please write answer in Scheme code. Don't use loops/assignments. And please don't copy answers from elsewhere.

Problem 4 [16pt] Implement the following functions in Scheme using fold-left and map. DO NOT use recursive definition for this problem. a) (4pt) Define a function addone, which takes a list of numbers and returns a list where each number in the input list is increased by one. For example, (addone (1 23 4)) should return (2 3 4 5), and (addone '(2 4 6 8)) should return (35 79) b) (Sp) Define a function 1stOR, which takes a list of Booleans and returns #f if and only if all of the Booleans are false. For example, (1stORwt #f)) should return #t, and (1stOR,(#f #f)) should return #f. For your convenience, (1stOR ,O) is defined as #f (functions and, or implement logical A, V in Scheme). c) (7pt) Define a function removeDup, which takes a list of ordered numbers, and returns a list that is identical to the input except that duplicated numbers are removed. For example, (removeDup '(1 1 2)) should return (1 2); (removeDup '(3 557779)) should return (3579)