what is an optimal way of merging two sorted sequences (of length n) in a parallel / distributed setting