Problem 3: (20 points) A sequence of numbers a1,..,am is called mirrored if m is even and for -i+1. For example, 3,-4, 4 of numbers 1,...,In design an O(n2) time algorithm that outputs the length of the longest mirrored subsequence. For example, on input 1,5,-1,3 the longest mirrored subsequence is 1,-1 and its length is 2. (Hint: For i j, let p(i, j) denote the length of the longest mirrored subsequence in xi, .. . , aj. Express p(i,j) in terms of p(i +1,j),p(i,j -1),p(i +1,j-1. Evaluate the values p(i,j) in order of increasing li-jl. ) Problem 3: (20 points) A sequence of numbers a1,..,am is called mirrored if m is even and for -i+1. For example, 3,-4, 4 of numbers 1,...,In design an O(n2) time algorithm that outputs the length of the longest mirrored subsequence. For example, on input 1,5,-1,3 the longest mirrored subsequence is 1,-1 and its length is 2. (Hint: For i j, let p(i, j) denote the length of the longest mirrored subsequence in xi, .. . , aj. Express p(i,j) in terms of p(i +1,j),p(i,j -1),p(i +1,j-1. Evaluate the values p(i,j) in order of increasing li-jl. )