Your task today is very simple. Write a ‘remove’ procedure. It takes two arguments: a value, and a well formed list, and it should remove the left-most occurence of the value in the list (as determine by eqv?).
Rewrite the above procedure so that it shares as much of a tail as possible with the original procedure. In particular, if the element