Given two sorted lists, L1 and L2, write a procedure to compute L1 ∩ L2 using only the basic list operations.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.