[5] Consider the Racket function intersperse, which takes an item and a list, and returns a new list consisting of the items in the original list,...

1. [5] Consider the Racket function intersperse, which takes an item and a list, and returns a new list consisting of the items in the original list, with the new item inserted between each element. For example: > (intersperse 1 '(2 3 4 5)) '(2 1 3 1 4 1 5) > ; edge cases > (intersperse 1 '()) '() > (intersperse 1 '(2)) '(2) Implement this function without using explicit recursion, but instead using higher-order list functions. (Solutions using explicit recursion will be awarded at most 3 marks.) You are encouraged to define your own helper functions. The only list functions you may use are the ones found on the aid sheet. Hint: you may find it easier to generate a list like '(1 2 1 3 1 4 1 5) first.