plz in Scheme b. [2 marks] Create a function (alternate listi list2) that creates a list…

plz
in Scheme

b. [2 marks] Create a function (alternate listi list2) that creates a list by alternating elements from the two given input lists. E.g.: (alternate ‘(0 000) ‘(1 1 1 1 1 1)) + (010101 c. [2 marks] Create a procedure (count x L) that returns the number of instances of the value x in the list L. E.g.: (count 3 ‘(1 4 3 6 2 3 3 1 4 3 5 7)) + 4 (count ‘b'(4 b a 32 c b1 b2 da)) + 3 d. [4 marks] Create a procedure (mode L) that returns the most common value in the list L. Hint: this question is asking that you find the item with the largest count. In the case of a tie return the value closest to the front of the list (ie the first one encountered). E.g., (mode ‘(a bac add a b ca b)) → a (mode ‘(2 ba 3 2 c bi b 2 d a)) + 2 e. [5 marks] Create a procedure (decreasing L) that returns a list of all of the consecutive decreasing subseqeuences in the input list. E.g. (decreasing ‘(3 6 8 9 7 4 8 6 3)) + ((974) (14) (decreasing ‘(7 6 5 4 8 5 2 5 1 5 2 1)) + ((7 6 5 4 (decreasing ‘(1 2 3 4 5)) ()