Question: Using a racket programming language, write a function (merge n m predicate) that merges two sorted list n and m into a single sorted list.
Using a racket programming language, write a function (merge n m predicate) that merges two sorted list n and m into a single sorted list. ordering is determined by predicate as described. You may assume n and m are sorted. You can test your functions using integers.
Thank you!
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
