17 (100 PTS.) Closest subsequence Define the L1-distance between two sequences of real numbers (a,..., am) and (bi, ..., bm) to be la -blam -bm Consider the following problem: given two sequences of real numbers A -(a,. . , am) and B - (bi,.bn) with m K n, find a subsequence of B of length m that minimizes its Li-distance to A (70 PTS.) Describe an algorithm, as fast as possible, that computes the Li-distance of the optimal subsequence of B to A. Bound the running time of your algorithm as a function of 17.A. m and n 17.B. (30 PTS.) Describe how to modify your algorithm in (A) so that it computes the optimal 17 (100 PTS.) Closest subsequence Define the L1-distance between two sequences of real numbers (a,..., am) and (bi, ..., bm) to be la -blam -bm Consider the following problem: given two sequences of real numbers A -(a,. . , am) and B - (bi,.bn) with m K n, find a subsequence of B of length m that minimizes its Li-distance to A (70 PTS.) Describe an algorithm, as fast as possible, that computes the Li-distance of the optimal subsequence of B to A. Bound the running time of your algorithm as a function of 17.A. m and n 17.B. (30 PTS.) Describe how to modify your algorithm in (A) so that it computes the optimal