The longest increasing subsequence problem is a problem to find the length of a subsequence from a sequence of array elements such that the subsequence is sorted in increasing order and it s length is maximum. This problem can be solved using __________

• A. Recursion
• B. Dynamic programming
• C. Brute force
• D. Recursion, Dynamic programming, Brute force