This is a Scheme

Removes all occurrences of v from lst using tail recursion, where v is an integer and lst is a list of integers,. The function must use tail recursion.

(define (removeTail v lst)

; TODO: Fill this in

'() ; stub -- modify it accordingly

)