Please answer the following question in racket language. The template is provided below. The answer should strictly follow the template. *Solutions are expected to only use functions from the standard library that was given* Solution Template: Use this for the solution

#lang racket (require rackunit) (provide (all-defined-out)) ;; Exercise 2: Interperse ;; Solution has 11 lines. ( Write your code here) (define (intersperse l v) 'todo)

2. (15 points) Implement a tail-recursive function intersperse that takes a list 1 and an element e and returns a list with the elements in list 1 interspersed with element e. The implementation must only use the list constructors and selectors that we covered in our class. That is, return a list where we add element e between each pair of elements in 1. For instance, (check-equal? (list 10 203) (intersperse (list 1 2 3) o)) 2. (15 points) Implement a tail-recursive function intersperse that takes a list 1 and an element e and returns a list with the elements in list 1 interspersed with element e. The implementation must only use the list constructors and selectors that we covered in our class. That is, return a list where we add element e between each pair of elements in 1. For instance, (check-equal? (list 10 203) (intersperse (list 1 2 3) o))