Code the problem in scheme. Make use you test it and follows the requirement:

9. Write the following function using call/cc and a single helper function that uses "normal" recursion instead of tail recursion. Your solution should do a single traversal of the list. collapse-x takes an atom and a list. If the does not appear in the list, or appears only once, then the list itself is returned. If the atom appears more than once, then all elements between the first occurrence and last occurrence of the atom are removed. >( collapse-x 'x ' (abccde)) (abcd b ) >( collapse-x 'x ' (abx(collapsex 'x ' (abxcdexfghij)) (abxhij)