Problem 5. Let X[1, ..., k] be a sequence of numbers. We say that X is kind-of-increasing if for each i > 3, we have X[i] > X[i 3]. Describe and analyze an algorithm to compute the longest kind-of-increasing subsequence of a given sequence A[1, ..., n]. Argue that your algorithm is correct. Your algorithm should work in polynomial time. Problem 5. Let X[1, ..., k] be a sequence of numbers. We say that X is kind-of-increasing if for each i > 3, we have X[i] > X[i 3]. Describe and analyze an algorithm to compute the longest kind-of-increasing subsequence of a given sequence A[1, ..., n]. Argue that your algorithm is correct. Your algorithm should work in polynomial time