Code the problem in scheme using continuation passing style (CPS) and tail recursion. Make sure it can run!

6. everyotherback takes a list of atoms and returns a list that contains every other atom of the list ending with the last atom. The solution should do a single pass of the data > (everyotherback ' ( a b c d e fg)) '(a c e g) > (everyotherback ' (a b c d e fgh)) '(b f f h) 7. mergesort takes a list of numbers and returns a list in sorted, non-decreasing order. The method should use the split method from lecture and the merge method above