Need help to fix this Scheme code. Please don't use 'let' 'append' 'reverse' 'remove' auxiliary function. Use a normal recursive algorithm.

(define (add-between list value)

(cond [(null? list ) '())]

[(null? (rest (cons (first list ) (cons value (add-between (rest list) value))))]

[else

(cons (first list) (cons value (add-between (rest list) value)))])).

(add-between (list a b c d) e)

;; d as value. Add between to get result as '(a e b e c e d). Don't let value e added at last. Thanks!