Let A and B be two sequences of n integers each. Given an integer m , describe an O ( n log n )-time algorithm for determining if there is an integer a in A and an integer b in B such that m = a + b ....

Let
A
and
B
be two sequences of
n
integers each. Given an integer
m,

describe an
O(nlog
n)-time algorithm for determining if there is an integer

a
in
A
and an integer
b
in
B
such that
m
=
a+b.

Given a set of
n
integers, describe and analyze a fast method for finding

the log
n_ integers closest to the median.

Our quick-select implementation can be made more space-efficient by initially

computing only the
counts
for sets
L,
E, and
G, creating only the new

subset that will be needed for recursion. Implement such a version.