Code the problem in scheme using continuation passing style (CPS) and tail recursion. Make sure it can run as the test sample! Don't copy from other wrong chegg answer!

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. 8. replaceallwith* takes an atom a list that can contain sublists and a list of atom. Each occurrence if the atom in the first list is replaced by one of the atoms of the second list, in order. So, the first occurrence of the atom in the first list is replaced by the first atom of the second list, the second occurrence is replaced by the second atom of the second list, and so on. If there are not enough atoms in the second list, the rest of the first list is unchanged. > (replaceallwith* 'x '(a bx ((cd((x) e fx)g(xixj))))(123456789)) 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. 8. replaceallwith* takes an atom a list that can contain sublists and a list of atom. Each occurrence if the atom in the first list is replaced by one of the atoms of the second list, in order. So, the first occurrence of the atom in the first list is replaced by the first atom of the second list, the second occurrence is replaced by the second atom of the second list, and so on. If there are not enough atoms in the second list, the rest of the first list is unchanged. > (replaceallwith* 'x '(a bx ((cd((x) e fx)g(xixj))))(123456789))